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_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:38:39,719 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:38:39,722 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:38:39,738 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:38:39,738 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:38:39,739 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:38:39,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:38:39,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:38:39,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:38:39,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:38:39,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:38:39,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:38:39,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:38:39,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:38:39,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:38:39,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:38:39,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:38:39,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:38:39,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:38:39,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:38:39,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:38:39,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:38:39,775 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:38:39,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:38:39,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:38:39,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:38:39,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:38:39,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:38:39,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:38:39,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:38:39,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:38:39,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:38:39,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:38:39,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:38:39,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:38:39,788 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:38:39,788 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-03-04 16:38:39,815 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:38:39,816 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:38:39,818 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:38:39,819 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:38:39,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:38:39,819 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:38:39,819 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:38:39,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:38:39,820 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:38:39,822 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:38:39,822 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-03-04 16:38:39,822 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:38:39,822 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:38:39,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:38:39,823 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:38:39,824 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:38:39,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:38:39,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:38:39,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:38:39,824 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:38:39,824 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:38:39,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:38:39,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:38:39,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:38:39,827 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:38:39,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:38:39,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:38:39,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:38:39,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:38:39,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:38:39,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:39,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:38:39,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:38:39,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:38:39,829 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:38:39,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:38:39,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:38:39,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:38:39,830 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:38:39,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:38:39,878 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:38:39,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:38:39,883 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:38:39,883 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:38:39,884 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-03-04 16:38:39,885 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-03-04 16:38:39,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:38:39,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:38:39,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:39,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:38:39,928 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:38:39,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:39,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:39,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:38:39,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:38:39,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:38:39,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:38:40,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... [2019-03-04 16:38:40,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:38:40,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:38:40,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:38:40,031 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:38:40,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:38:40,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:38:40,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:38:40,484 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:38:40,484 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-03-04 16:38:40,486 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:40 BoogieIcfgContainer [2019-03-04 16:38:40,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:38:40,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:38:40,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:38:40,492 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:38:40,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:38:39" (1/2) ... [2019-03-04 16:38:40,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d41b1cc and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:38:40, skipping insertion in model container [2019-03-04 16:38:40,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:38:40" (2/2) ... [2019-03-04 16:38:40,496 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-03-04 16:38:40,509 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:38:40,529 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-03-04 16:38:40,561 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-03-04 16:38:40,596 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:38:40,596 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:38:40,597 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:38:40,597 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:38:40,597 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:38:40,597 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:38:40,597 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:38:40,598 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:38:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-03-04 16:38:40,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:38:40,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:40,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:38:40,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-03-04 16:38:40,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:40,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:40,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:40,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:40,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:40,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:40,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:40,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:40,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:40,821 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-03-04 16:38:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:40,999 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-03-04 16:38:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:41,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:38:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:41,014 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:38:41,014 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:41,017 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-03-04 16:38:41,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-03-04 16:38:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:38:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-03-04 16:38:41,053 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-03-04 16:38:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:41,054 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-03-04 16:38:41,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-03-04 16:38:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:41,055 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:41,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:41,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-03-04 16:38:41,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:41,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:41,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:41,200 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:41,201 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-03-04 16:38:41,276 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:41,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:41,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:41,379 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:41,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:41,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:41,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 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-03-04 16:38:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:41,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:41,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:41,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:41,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:41,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:41,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:41,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,693 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:41,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:41,893 INFO L301 Elim1Store]: Index analysis took 174 ms [2019-03-04 16:38:41,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:41,896 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,962 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:41,985 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,050 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,063 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,132 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:42,132 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:42,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:42,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:42,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:42,350 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:42,351 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:42,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,379 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:42,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:42,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:42,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:42,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:42,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:42,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:42,521 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-03-04 16:38:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:43,218 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-03-04 16:38:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:43,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:43,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:43,220 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:43,220 INFO L226 Difference]: Without dead ends: 37 [2019-03-04 16:38:43,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-03-04 16:38:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-03-04 16:38:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:38:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-03-04 16:38:43,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-03-04 16:38:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:43,228 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-03-04 16:38:43,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-03-04 16:38:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:43,228 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:43,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:43,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-03-04 16:38:43,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:43,382 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:43,382 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-03-04 16:38:43,389 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:43,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:43,401 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:43,401 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:43,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:43,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:43,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:43,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:43,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:43,477 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:43,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,487 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:43,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,505 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:43,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:43,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,578 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:43,579 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,613 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,625 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,638 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,650 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,677 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:43,678 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:43,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:43,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:43,756 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:43,782 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:43,783 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:38:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:43,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:38:43,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:43,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:43,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:43,857 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-03-04 16:38:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:43,910 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-03-04 16:38:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:43,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:38:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:43,912 INFO L225 Difference]: With dead ends: 18 [2019-03-04 16:38:43,912 INFO L226 Difference]: Without dead ends: 17 [2019-03-04 16:38:43,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-03-04 16:38:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-03-04 16:38:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-03-04 16:38:43,918 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-03-04 16:38:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:43,918 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-03-04 16:38:43,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-03-04 16:38:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:43,919 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:43,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:43,919 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:43,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-03-04 16:38:43,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:43,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:43,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:43,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:43,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:43,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:43,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:43,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:43,964 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-03-04 16:38:44,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,030 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-03-04 16:38:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:44,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:38:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,031 INFO L225 Difference]: With dead ends: 21 [2019-03-04 16:38:44,032 INFO L226 Difference]: Without dead ends: 20 [2019-03-04 16:38:44,032 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-03-04 16:38:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-03-04 16:38:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-03-04 16:38:44,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:38:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-03-04 16:38:44,037 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-03-04 16:38:44,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,038 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-03-04 16:38:44,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:44,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-03-04 16:38:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:38:44,039 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:38:44,039 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,040 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-03-04 16:38:44,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:38:44,125 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-03-04 16:38:44,127 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:44,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:44,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:44,134 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:44,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:44,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:44,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:44,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:44,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:44,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:44,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,244 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,246 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:44,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:44,307 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,316 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,329 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,343 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,414 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:44,415 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:44,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:44,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:44,466 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:44,505 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:44,506 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:44,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:44,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:44,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:44,563 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-03-04 16:38:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:44,869 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-03-04 16:38:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:44,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:38:44,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:44,872 INFO L225 Difference]: With dead ends: 39 [2019-03-04 16:38:44,872 INFO L226 Difference]: Without dead ends: 38 [2019-03-04 16:38:44,873 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-03-04 16:38:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-03-04 16:38:44,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-03-04 16:38:44,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-03-04 16:38:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-03-04 16:38:44,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-03-04 16:38:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:44,878 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-03-04 16:38:44,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-03-04 16:38:44,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:44,879 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:44,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:44,880 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-03-04 16:38:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:44,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:44,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:44,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:44,999 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:45,000 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-03-04 16:38:45,003 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:45,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:45,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:45,009 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:45,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:45,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:45,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:45,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:45,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:45,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:45,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:45,073 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:45,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:45,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:45,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:45,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:45,219 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,235 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,246 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,260 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,272 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,291 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:45,292 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:45,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,345 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:45,345 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,380 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:45,381 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:45,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:45,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:45,420 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:45,442 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:45,443 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:38:45,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-03-04 16:38:45,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:45,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:45,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:45,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:45,545 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-03-04 16:38:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:46,091 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-03-04 16:38:46,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:46,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:46,097 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:38:46,097 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:46,098 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-03-04 16:38:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-03-04 16:38:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-03-04 16:38:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-03-04 16:38:46,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-03-04 16:38:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:46,104 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-03-04 16:38:46,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-03-04 16:38:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:46,105 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:46,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:46,106 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-03-04 16:38:46,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:46,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:46,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:46,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:46,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:46,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:46,214 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-03-04 16:38:46,217 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:46,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:46,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:46,223 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:46,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:46,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:46,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 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-03-04 16:38:46,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:46,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:46,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:46,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:46,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:46,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:46,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:46,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:46,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:46,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:46,337 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,347 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,358 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,397 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,408 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,428 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,429 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:46,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,464 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:46,465 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,486 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:46,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:46,761 INFO L301 Elim1Store]: Index analysis took 218 ms [2019-03-04 16:38:46,762 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:46,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:46,912 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:46,913 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:38:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:47,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:38:47,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:47,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:47,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:47,042 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-03-04 16:38:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:47,493 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-03-04 16:38:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:47,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:47,494 INFO L225 Difference]: With dead ends: 47 [2019-03-04 16:38:47,494 INFO L226 Difference]: Without dead ends: 46 [2019-03-04 16:38:47,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-03-04 16:38:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-03-04 16:38:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:38:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-03-04 16:38:47,503 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-03-04 16:38:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:47,503 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-03-04 16:38:47,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-03-04 16:38:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:47,504 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:47,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:47,504 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-03-04 16:38:47,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:47,576 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:47,576 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-03-04 16:38:47,579 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:47,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:47,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:47,586 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:47,586 INFO 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-03-04 16:38:47,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:47,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:47,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:47,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:47,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:38:47,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,651 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:38:47,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:38:47,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:38:47,701 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,718 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,729 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,739 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,750 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,768 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:47,768 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:38:47,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:47,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:47,818 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:47,834 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:47,834 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:47,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:47,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:38:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:38:47,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:47,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:38:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:38:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:47,883 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-03-04 16:38:47,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:47,943 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-03-04 16:38:47,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:47,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:38:47,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:47,944 INFO L225 Difference]: With dead ends: 28 [2019-03-04 16:38:47,944 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:38:47,945 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-03-04 16:38:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:38:47,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-03-04 16:38:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:38:47,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-03-04 16:38:47,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-03-04 16:38:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:47,953 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-03-04 16:38:47,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:38:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-03-04 16:38:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:47,954 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:47,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:47,954 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:47,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-03-04 16:38:47,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:47,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:47,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:48,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:48,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:48,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:48,099 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-03-04 16:38:48,103 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:48,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:48,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:48,108 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:48,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:48,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:48,108 INFO 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-03-04 16:38:48,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:48,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:48,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:48,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:48,152 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:48,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,158 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:48,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:48,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,199 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:48,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,250 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:48,250 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,266 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,279 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,290 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,300 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,320 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:48,320 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:48,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:48,358 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,380 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:48,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:48,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:48,419 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:48,420 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:48,444 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:48,444 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:38:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:48,474 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:48,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:48,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:48,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:48,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:48,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:48,545 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-03-04 16:38:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:49,002 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-03-04 16:38:49,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:49,002 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:49,003 INFO L225 Difference]: With dead ends: 44 [2019-03-04 16:38:49,003 INFO L226 Difference]: Without dead ends: 43 [2019-03-04 16:38:49,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-03-04 16:38:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-03-04 16:38:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:38:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-03-04 16:38:49,011 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-03-04 16:38:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:49,011 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-03-04 16:38:49,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-03-04 16:38:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:49,012 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:49,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:49,012 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-03-04 16:38:49,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:49,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:49,076 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-03-04 16:38:49,080 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:49,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:49,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:49,085 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:49,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,086 INFO 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-03-04 16:38:49,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:49,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:49,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:38:49,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:38:49,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:38:49,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:38:49,192 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,208 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,219 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,230 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,242 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:49,259 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:38:49,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,393 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:49,393 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:49,411 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,438 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:49,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:49,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:49,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:49,469 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-03-04 16:38:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:49,634 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-03-04 16:38:49,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:49,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:49,635 INFO L225 Difference]: With dead ends: 43 [2019-03-04 16:38:49,636 INFO L226 Difference]: Without dead ends: 42 [2019-03-04 16:38:49,636 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-03-04 16:38:49,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-03-04 16:38:49,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-03-04 16:38:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-03-04 16:38:49,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-03-04 16:38:49,644 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-03-04 16:38:49,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:49,644 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-03-04 16:38:49,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:49,644 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-03-04 16:38:49,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:49,645 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:49,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:49,645 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-03-04 16:38:49,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:49,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:49,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:49,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:49,769 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-03-04 16:38:49,771 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:49,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:49,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:49,779 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:49,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:49,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:49,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:49,781 INFO 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-03-04 16:38:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:49,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:49,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:49,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:49,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:49,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,848 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:49,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,868 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:49,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:49,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:49,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:49,973 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,982 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:49,991 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,001 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,011 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,027 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:50,027 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:50,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:50,066 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,084 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:50,084 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:38:50,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,140 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:50,141 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,166 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:50,166 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:50,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:50,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:50,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:50,253 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-03-04 16:38:50,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:50,708 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-03-04 16:38:50,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:50,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:50,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:50,710 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:38:50,710 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:38:50,711 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-03-04 16:38:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:38:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-03-04 16:38:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:38:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-03-04 16:38:50,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-03-04 16:38:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:50,721 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-03-04 16:38:50,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-03-04 16:38:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:50,722 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:50,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:50,722 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:50,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:50,723 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-03-04 16:38:50,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:50,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:50,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:50,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:38:50,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:38:50,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:50,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:50,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:38:50,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:38:50,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:38:50,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:38:50,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:50,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:50,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:50,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:50,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,864 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:50,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:50,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:50,907 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,917 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,927 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,938 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,955 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:50,974 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:50,975 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:50,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:50,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:51,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,030 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:51,030 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:38:51,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,059 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:51,060 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,076 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:51,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:51,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:51,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:38:51,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:51,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:51,128 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-03-04 16:38:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:51,563 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-03-04 16:38:51,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:38:51,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:51,565 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:38:51,565 INFO L226 Difference]: Without dead ends: 64 [2019-03-04 16:38:51,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-03-04 16:38:51,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-03-04 16:38:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:38:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-03-04 16:38:51,575 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-03-04 16:38:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:51,575 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-03-04 16:38:51,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-03-04 16:38:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:51,576 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:51,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:51,576 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:51,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:51,576 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-03-04 16:38:51,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:51,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:51,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:38:51,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:51,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:51,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:51,628 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-03-04 16:38:51,629 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:51,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:51,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:51,633 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:51,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:51,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:51,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:51,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:51,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:51,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:51,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:51,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:51,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:51,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:51,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:51,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:51,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,725 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:51,725 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,735 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,745 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,755 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,765 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,784 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:51,784 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:51,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:51,814 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:51,815 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:51,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:51,837 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:38:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:51,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:51,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:51,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:51,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:51,892 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-03-04 16:38:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:52,081 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-03-04 16:38:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:52,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:52,083 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:52,083 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:52,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-03-04 16:38:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-03-04 16:38:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-03-04 16:38:52,092 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-03-04 16:38:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:52,092 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-03-04 16:38:52,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-03-04 16:38:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:52,093 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:52,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:52,093 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,093 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-03-04 16:38:52,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:52,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:38:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:38:52,115 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:38:52,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:38:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:38:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:38:52,116 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-03-04 16:38:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:52,152 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-03-04 16:38:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:38:52,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-03-04 16:38:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:52,154 INFO L225 Difference]: With dead ends: 34 [2019-03-04 16:38:52,154 INFO L226 Difference]: Without dead ends: 31 [2019-03-04 16:38:52,154 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-03-04 16:38:52,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-03-04 16:38:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-03-04 16:38:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:38:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-03-04 16:38:52,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-03-04 16:38:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:52,162 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-03-04 16:38:52,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:38:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-03-04 16:38:52,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:52,163 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:52,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:52,164 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,164 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-03-04 16:38:52,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:52,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:52,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:52,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:52,269 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-03-04 16:38:52,271 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:52,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:52,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:52,276 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:52,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:52,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:52,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:52,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:52,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:52,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:52,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:52,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,322 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:52,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,333 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:52,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:52,353 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,364 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,374 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,384 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,395 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:52,415 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:52,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:52,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,507 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:52,507 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:52,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:52,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:52,543 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:52,559 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:52,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:38:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:52,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:52,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:38:52,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:52,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:52,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:52,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:38:52,641 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-03-04 16:38:52,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:52,966 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-03-04 16:38:52,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:52,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:52,968 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:38:52,968 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:38:52,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:38:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-03-04 16:38:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:38:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-03-04 16:38:52,978 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-03-04 16:38:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:52,978 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-03-04 16:38:52,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-03-04 16:38:52,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:52,979 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:52,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:52,979 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:52,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-03-04 16:38:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:52,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:52,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:52,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,237 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:38:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:53,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:53,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:53,242 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-03-04 16:38:53,244 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:53,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:53,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:53,248 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:53,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:53,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:53,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:53,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:38:53,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:53,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:53,287 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:38:53,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:38:53,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,334 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:38:53,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,380 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:38:53,380 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,395 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,407 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,420 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,433 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,454 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:53,455 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:38:53,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:53,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:53,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:38:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:53,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:53,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:53,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:53,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:53,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:53,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:53,550 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-03-04 16:38:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:53,680 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-03-04 16:38:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:53,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:38:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:53,681 INFO L225 Difference]: With dead ends: 51 [2019-03-04 16:38:53,681 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:38:53,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:38:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:38:53,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-03-04 16:38:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:38:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-03-04 16:38:53,691 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-03-04 16:38:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:53,692 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-03-04 16:38:53,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-03-04 16:38:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:38:53,692 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:53,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:38:53,693 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-03-04 16:38:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:53,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:53,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:53,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:53,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:38:53,835 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-03-04 16:38:53,836 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:53,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:53,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:53,842 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:53,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:53,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:53,842 INFO 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-03-04 16:38:53,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:53,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:53,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:53,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:53,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:53,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:53,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,881 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:53,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:53,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:53,932 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:53,932 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,942 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,952 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,962 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,973 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:53,992 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:53,993 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:54,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,041 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:54,042 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,058 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:54,059 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:38:54,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:54,091 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,109 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:54,109 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:54,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:54,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:54,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:54,178 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-03-04 16:38:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:54,656 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-03-04 16:38:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:54,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:38:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:54,658 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:38:54,658 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:38:54,658 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-03-04 16:38:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:38:54,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-03-04 16:38:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:38:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-03-04 16:38:54,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-03-04 16:38:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:54,670 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-03-04 16:38:54,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-03-04 16:38:54,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:54,671 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:54,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:54,671 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,671 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-03-04 16:38:54,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:54,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:54,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:54,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:54,762 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:54,762 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-03-04 16:38:54,763 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:54,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:54,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:54,767 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:54,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:54,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:54,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:54,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:38:54,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:54,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:54,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:38:54,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:54,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:54,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:38:54,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,824 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:38:54,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:38:54,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:38:54,858 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,866 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,875 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,885 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,895 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,913 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:54,913 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:38:54,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:38:54,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:54,975 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:54,975 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:38:54,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:54,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:38:55,000 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,015 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:55,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:38:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:55,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:55,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:55,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:55,078 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-03-04 16:38:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:55,688 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-03-04 16:38:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:55,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:55,690 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:38:55,690 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:38:55,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:38:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-03-04 16:38:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:38:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-03-04 16:38:55,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-03-04 16:38:55,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:55,701 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-03-04 16:38:55,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-03-04 16:38:55,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:55,702 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:55,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:55,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-03-04 16:38:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:55,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:55,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:55,846 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-03-04 16:38:55,846 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:55,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:55,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:55,850 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:38:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:55,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:55,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:55,851 INFO 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-03-04 16:38:55,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:55,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:55,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:55,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:55,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:55,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:55,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:55,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:55,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:55,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:55,920 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,937 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,947 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,957 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,967 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:55,986 INFO L309 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-03-04 16:38:55,986 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:56,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:56,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,041 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:56,042 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:56,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,081 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:56,082 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,099 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:56,100 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:38:56,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:56,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:56,150 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:56,169 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:56,169 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:38:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:56,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:56,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:56,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:38:56,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:56,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:56,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:56,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:38:56,294 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-03-04 16:38:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:57,395 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-03-04 16:38:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:38:57,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:38:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:57,397 INFO L225 Difference]: With dead ends: 68 [2019-03-04 16:38:57,397 INFO L226 Difference]: Without dead ends: 67 [2019-03-04 16:38:57,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:38:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-03-04 16:38:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-03-04 16:38:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:38:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-03-04 16:38:57,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-03-04 16:38:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:57,415 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-03-04 16:38:57,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:38:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-03-04 16:38:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:57,415 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:57,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:57,421 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-03-04 16:38:57,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:57,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:57,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:57,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,779 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:38:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:57,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:57,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:57,805 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-03-04 16:38:57,809 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:57,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:57,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:57,813 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:38:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:57,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:57,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:57,814 INFO 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-03-04 16:38:57,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:57,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:57,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:38:57,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:57,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:57,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:57,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:57,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:57,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:57,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:57,922 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,932 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,944 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,955 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,965 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:57,985 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:57,985 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:58,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,030 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:58,031 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,050 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:58,050 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:58,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,091 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:58,091 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,109 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:58,110 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:38:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:58,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:38:58,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:58,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:38:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:38:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:38:58,170 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-03-04 16:38:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:58,618 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-03-04 16:38:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:38:58,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:38:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:58,619 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:38:58,620 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:38:58,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:58,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:38:58,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-03-04 16:38:58,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-03-04 16:38:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-03-04 16:38:58,630 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-03-04 16:38:58,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:58,630 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-03-04 16:38:58,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:38:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-03-04 16:38:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:58,631 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:58,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:58,631 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:58,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-03-04 16:38:58,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:58,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:58,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:58,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:58,682 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-03-04 16:38:58,683 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:58,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:58,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:58,687 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:38:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:58,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:58,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:58,688 INFO 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-03-04 16:38:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:58,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:58,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:38:58,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:58,710 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:58,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:38:58,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:38:58,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,774 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:38:58,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:38:58,801 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,813 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,824 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,834 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,844 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,859 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:58,860 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:38:58,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:58,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:38:58,911 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:58,921 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:58,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:38:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,935 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:58,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:38:58,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:58,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:38:58,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:38:58,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:38:58,965 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-03-04 16:38:59,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:38:59,099 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-03-04 16:38:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:38:59,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:38:59,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:38:59,101 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:38:59,101 INFO L226 Difference]: Without dead ends: 44 [2019-03-04 16:38:59,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-03-04 16:38:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-03-04 16:38:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-03-04 16:38:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-03-04 16:38:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-03-04 16:38:59,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-03-04 16:38:59,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:38:59,111 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-03-04 16:38:59,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:38:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-03-04 16:38:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:38:59,112 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:38:59,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:38:59,112 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:38:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:59,113 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-03-04 16:38:59,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:38:59,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:59,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:38:59,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:38:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:59,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:38:59,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:38:59,205 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-03-04 16:38:59,206 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:38:59,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:38:59,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:38:59,211 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:38:59,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:38:59,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:38:59,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:38:59,212 INFO 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-03-04 16:38:59,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:38:59,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:38:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:38:59,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:38:59,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:38:59,254 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:38:59,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,262 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:38:59,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,277 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:38:59,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:38:59,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:38:59,331 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,416 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,425 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,435 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,446 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,466 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:59,466 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:38:59,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,587 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:38:59,588 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,643 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:59,643 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:38:59,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:38:59,707 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,728 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:59,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:38:59,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:38:59,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:38:59,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:38:59,821 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:38:59,822 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:38:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:38:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:38:59,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:38:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:38:59,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:38:59,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:38:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:38:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:38:59,916 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-03-04 16:39:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:00,509 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-03-04 16:39:00,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:00,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:00,514 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:39:00,514 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:39:00,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:39:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-03-04 16:39:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:39:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-03-04 16:39:00,525 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-03-04 16:39:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-03-04 16:39:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-03-04 16:39:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:00,526 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:00,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:00,527 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-03-04 16:39:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:00,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,805 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:39:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:00,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:00,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:00,811 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-03-04 16:39:00,813 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:00,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:00,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:00,817 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:00,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:00,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:00,818 INFO 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-03-04 16:39:00,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:00,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:00,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:00,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:00,844 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:00,859 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:00,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,877 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:00,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:00,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:00,911 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:00,912 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,920 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,930 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,940 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,950 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:00,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:00,968 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:01,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:01,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,027 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:01,027 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:01,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,051 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:01,052 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,066 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:01,067 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:01,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:01,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:01,126 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-03-04 16:39:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:01,432 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-03-04 16:39:01,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:01,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:01,434 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:39:01,434 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:39:01,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:39:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-03-04 16:39:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:39:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:39:01,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-03-04 16:39:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:01,446 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:39:01,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:39:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:01,446 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:01,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:01,447 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-03-04 16:39:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:01,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:01,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:01,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:01,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:01,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:01,623 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-03-04 16:39:01,624 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:01,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:01,627 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:01,628 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:01,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:01,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:01,628 INFO 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-03-04 16:39:01,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:01,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:01,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:01,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:01,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:01,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,683 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:01,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:01,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,709 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:01,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:01,737 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,747 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,758 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,768 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,777 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,796 INFO L309 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-03-04 16:39:01,796 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:01,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,849 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:01,849 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,869 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:01,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:01,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:01,905 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,924 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:01,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:01,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:01,961 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:01,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:01,981 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:01,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:02,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-03-04 16:39:02,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:02,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:02,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:02,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:02,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:02,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:02,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:02,072 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-03-04 16:39:02,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:02,788 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-03-04 16:39:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:02,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:02,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:02,789 INFO L225 Difference]: With dead ends: 71 [2019-03-04 16:39:02,790 INFO L226 Difference]: Without dead ends: 70 [2019-03-04 16:39:02,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-03-04 16:39:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-03-04 16:39:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:39:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-03-04 16:39:02,799 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-03-04 16:39:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-03-04 16:39:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:02,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-03-04 16:39:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:02,800 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:02,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:02,800 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,800 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-03-04 16:39:02,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:02,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:02,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:02,897 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:02,897 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-03-04 16:39:02,899 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:02,899 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:02,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:02,902 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:02,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:02,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:02,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:02,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:02,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:02,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:02,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:02,942 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:02,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:02,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,951 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:02,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:02,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:02,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:02,977 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,987 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:02,997 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,007 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,017 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,036 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:03,036 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:03,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:03,068 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:03,312 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:03,312 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:03,512 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-03-04 16:39:03,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:03,761 INFO L301 Elim1Store]: Index analysis took 219 ms [2019-03-04 16:39:03,762 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:03,763 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:04,012 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:04,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:04,217 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-03-04 16:39:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:04,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:04,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:04,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:04,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:04,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:04,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:04,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:04,546 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-03-04 16:39:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:04,915 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-03-04 16:39:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:04,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:04,917 INFO L225 Difference]: With dead ends: 66 [2019-03-04 16:39:04,917 INFO L226 Difference]: Without dead ends: 65 [2019-03-04 16:39:04,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-03-04 16:39:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-03-04 16:39:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:39:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:39:04,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-03-04 16:39:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:04,930 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:39:04,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:39:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:04,931 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:04,931 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:04,932 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-03-04 16:39:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:04,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,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-03-04 16:39:05,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:05,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:05,155 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-03-04 16:39:05,156 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:05,156 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:05,159 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:05,159 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:05,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:05,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:05,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:05,160 INFO 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-03-04 16:39:05,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:05,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:05,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:05,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:05,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:05,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,243 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:05,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:05,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,485 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:39:05,486 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:05,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:05,748 INFO L301 Elim1Store]: Index analysis took 238 ms [2019-03-04 16:39:05,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:05,750 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:05,899 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,043 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,157 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,310 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,538 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,538 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:06,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,629 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:06,629 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,649 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,649 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:06,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:06,692 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,748 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:06,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:06,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:06,790 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:06,835 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:06,836 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,856 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:06,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:06,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:06,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:06,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:06,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:06,922 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-03-04 16:39:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:07,566 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-03-04 16:39:07,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:07,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:07,568 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:39:07,568 INFO L226 Difference]: Without dead ends: 92 [2019-03-04 16:39:07,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-03-04 16:39:07,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-03-04 16:39:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-03-04 16:39:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-03-04 16:39:07,581 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-03-04 16:39:07,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:07,581 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-03-04 16:39:07,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:07,581 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-03-04 16:39:07,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:07,581 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:07,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:07,582 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-03-04 16:39:07,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:07,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:07,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:07,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:07,719 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-03-04 16:39:07,720 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:07,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:07,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:07,729 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:07,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:07,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:07,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:07,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:07,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:07,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:39:07,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:07,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:07,889 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:07,906 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:39:07,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,927 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:39:07,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:07,954 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:39:07,954 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,963 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,973 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,983 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:07,993 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,027 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,027 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:39:08,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:08,053 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,060 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,061 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:39:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,072 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:08,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:39:08,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:08,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:08,102 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-03-04 16:39:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:08,143 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-03-04 16:39:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:08,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-03-04 16:39:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:08,145 INFO L225 Difference]: With dead ends: 56 [2019-03-04 16:39:08,145 INFO L226 Difference]: Without dead ends: 55 [2019-03-04 16:39:08,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-03-04 16:39:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-03-04 16:39:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-03-04 16:39:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:39:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-03-04 16:39:08,159 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-03-04 16:39:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:08,159 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-03-04 16:39:08,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-03-04 16:39:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:08,159 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:08,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:08,160 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-03-04 16:39:08,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:08,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:08,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:08,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:08,230 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-03-04 16:39:08,231 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:08,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:08,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:08,235 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:08,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:08,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:08,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 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-03-04 16:39:08,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:08,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:08,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:08,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:08,255 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:08,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:08,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:08,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:08,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,359 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:08,360 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,368 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,378 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,388 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,398 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,415 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,415 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:08,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:08,472 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,484 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,485 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:08,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:08,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:08,507 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:08,522 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:08,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:08,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:08,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:08,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:08,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:08,573 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-03-04 16:39:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:08,931 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-03-04 16:39:08,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:08,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:08,933 INFO L225 Difference]: With dead ends: 85 [2019-03-04 16:39:08,933 INFO L226 Difference]: Without dead ends: 84 [2019-03-04 16:39:08,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-03-04 16:39:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-03-04 16:39:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:39:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-03-04 16:39:08,950 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-03-04 16:39:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:08,950 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-03-04 16:39:08,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-03-04 16:39:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:08,950 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:08,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:08,951 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:08,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-03-04 16:39:08,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:08,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:08,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:09,096 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:09,097 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-03-04 16:39:09,098 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:09,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:09,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:09,101 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:09,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:09,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:09,102 INFO 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-03-04 16:39:09,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:09,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:09,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:09,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:09,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:09,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:09,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,145 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:09,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:09,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,173 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:09,173 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,183 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,193 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,203 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,212 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,231 INFO L309 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-03-04 16:39:09,231 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:09,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:09,268 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,287 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:09,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:09,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,492 INFO L301 Elim1Store]: Index analysis took 107 ms [2019-03-04 16:39:09,493 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:09,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:09,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:09,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:09,548 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:09,548 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:09,568 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:09,568 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:09,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:09,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:09,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:09,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:09,659 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-03-04 16:39:10,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:10,425 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-03-04 16:39:10,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:10,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:10,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:10,426 INFO L225 Difference]: With dead ends: 96 [2019-03-04 16:39:10,427 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:39:10,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:39:10,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-03-04 16:39:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:39:10,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-03-04 16:39:10,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-03-04 16:39:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:10,444 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-03-04 16:39:10,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-03-04 16:39:10,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:10,444 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:10,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:10,446 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:10,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-03-04 16:39:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:10,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,690 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:39:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:10,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:10,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:10,716 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-03-04 16:39:10,717 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:10,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:10,720 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:10,720 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:10,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:10,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:10,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:10,721 INFO 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-03-04 16:39:10,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:10,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:10,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:10,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:10,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:10,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:10,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,768 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:10,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,960 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:10,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:10,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:10,981 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:10,991 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,001 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,012 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,022 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,039 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,039 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:11,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:11,075 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,121 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,121 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:11,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,149 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:11,149 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,162 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,162 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,178 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:11,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:11,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:11,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:11,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:11,221 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-03-04 16:39:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:11,544 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-03-04 16:39:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:11,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:11,546 INFO L225 Difference]: With dead ends: 82 [2019-03-04 16:39:11,546 INFO L226 Difference]: Without dead ends: 81 [2019-03-04 16:39:11,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-03-04 16:39:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-03-04 16:39:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-03-04 16:39:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-03-04 16:39:11,566 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-03-04 16:39:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:11,567 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-03-04 16:39:11,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:11,567 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-03-04 16:39:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:11,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:11,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:11,568 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-03-04 16:39:11,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:11,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:11,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:11,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:11,667 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-03-04 16:39:11,668 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:11,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:11,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:11,671 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:11,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:11,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:11,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:11,671 INFO 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-03-04 16:39:11,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:11,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:11,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:11,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:11,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:11,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:11,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,703 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:11,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,713 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:11,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:11,731 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,744 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,755 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,765 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,775 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,794 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:11,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,820 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:11,821 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,838 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:11,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:11,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:11,881 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:11,897 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:11,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,037 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:12,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:12,068 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-03-04 16:39:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:12,384 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-03-04 16:39:12,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:12,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:12,386 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:39:12,386 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:39:12,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:39:12,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-03-04 16:39:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-03-04 16:39:12,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-03-04 16:39:12,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-03-04 16:39:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:12,407 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-03-04 16:39:12,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-03-04 16:39:12,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:12,407 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:12,408 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:12,408 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,408 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-03-04 16:39:12,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:12,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:12,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:12,513 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-03-04 16:39:12,514 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:12,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:12,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:12,517 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:12,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:12,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:12,518 INFO 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-03-04 16:39:12,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:12,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:12,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:12,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:12,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:12,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,565 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:12,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:12,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:12,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,605 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:12,605 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,615 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,626 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,635 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,644 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,664 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:12,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,696 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:12,697 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:12,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:12,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:12,749 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:12,768 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:12,768 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:12,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:12,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:12,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:12,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:12,831 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-03-04 16:39:13,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:13,174 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-03-04 16:39:13,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:13,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:13,177 INFO L225 Difference]: With dead ends: 86 [2019-03-04 16:39:13,177 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:39:13,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:39:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-03-04 16:39:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-03-04 16:39:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-03-04 16:39:13,197 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-03-04 16:39:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:13,197 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-03-04 16:39:13,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-03-04 16:39:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:13,198 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:13,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:13,198 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:13,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:13,198 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-03-04 16:39:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:13,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:13,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:13,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:13,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:13,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:13,279 INFO 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-03-04 16:39:13,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:13,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:13,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:39:13,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:13,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:13,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:13,304 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:13,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:13,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:13,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:13,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:13,372 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,381 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,391 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,402 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,412 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,429 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,430 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:13,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:13,459 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,472 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,473 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:13,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:13,495 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:13,495 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:13,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:13,508 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,530 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:13,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:13,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:13,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:13,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:13,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:13,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:13,604 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-03-04 16:39:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:14,618 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-03-04 16:39:14,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:14,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:14,619 INFO L225 Difference]: With dead ends: 110 [2019-03-04 16:39:14,620 INFO L226 Difference]: Without dead ends: 107 [2019-03-04 16:39:14,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-03-04 16:39:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-03-04 16:39:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:39:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-03-04 16:39:14,647 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-03-04 16:39:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:14,648 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-03-04 16:39:14,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-03-04 16:39:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:14,648 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:14,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:14,649 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-03-04 16:39:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:14,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:14,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:14,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:14,797 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-03-04 16:39:14,798 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:14,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:14,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:14,801 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:14,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:14,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:14,802 INFO 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-03-04 16:39:14,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:14,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:14,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:14,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:14,832 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:14,853 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:14,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,868 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:14,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,888 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:14,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,908 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:14,908 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,916 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,927 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,937 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,947 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:14,963 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:14,963 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:14,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:14,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:14,997 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,012 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,013 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:39:15,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:39:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:39:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:15,061 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-03-04 16:39:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:15,293 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-03-04 16:39:15,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:39:15,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-03-04 16:39:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:15,295 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:39:15,296 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:39:15,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:39:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:39:15,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-03-04 16:39:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:39:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-03-04 16:39:15,318 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-03-04 16:39:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:15,318 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-03-04 16:39:15,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:39:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-03-04 16:39:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:15,319 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:15,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:15,319 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-03-04 16:39:15,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:15,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:15,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,500 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:39:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:15,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:15,536 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-03-04 16:39:15,537 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:15,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:15,539 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:15,539 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:15,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:15,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:15,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:15,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:15,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:15,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:15,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:15,559 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:15,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:15,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,574 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:15,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:15,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:15,600 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,609 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,619 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,629 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,638 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,656 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,657 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:15,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:15,705 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,722 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,722 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:15,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:15,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,773 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:15,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:15,806 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:15,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:15,826 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:15,826 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:15,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:15,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:15,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:15,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:15,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:15,901 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-03-04 16:39:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:16,446 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-03-04 16:39:16,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:16,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-03-04 16:39:16,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:16,450 INFO L225 Difference]: With dead ends: 133 [2019-03-04 16:39:16,450 INFO L226 Difference]: Without dead ends: 132 [2019-03-04 16:39:16,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:16,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-03-04 16:39:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-03-04 16:39:16,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-03-04 16:39:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-03-04 16:39:16,470 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-03-04 16:39:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:16,470 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-03-04 16:39:16,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-03-04 16:39:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-03-04 16:39:16,471 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:16,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-03-04 16:39:16,471 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,471 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-03-04 16:39:16,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:16,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,618 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2019-03-04 16:39:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:16,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-03-04 16:39:16,625 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-03-04 16:39:16,626 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:16,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:16,629 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:16,629 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:16,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:16,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:16,629 INFO 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-03-04 16:39:16,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:16,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:16,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:16,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:16,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:16,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:16,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:16,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:16,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,711 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:16,712 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,720 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,730 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,739 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,749 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,765 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,765 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:16,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,797 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:16,798 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,811 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:16,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:16,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:16,866 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:16,880 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:16,881 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:16,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:16,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:16,927 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:16,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:16,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:16,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:16,928 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-03-04 16:39:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:17,269 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-03-04 16:39:17,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:17,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-03-04 16:39:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:17,271 INFO L225 Difference]: With dead ends: 113 [2019-03-04 16:39:17,271 INFO L226 Difference]: Without dead ends: 112 [2019-03-04 16:39:17,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-03-04 16:39:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-03-04 16:39:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:17,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-03-04 16:39:17,296 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-03-04 16:39:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:17,297 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-03-04 16:39:17,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-03-04 16:39:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:17,297 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:17,297 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:39:17,298 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:17,298 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-03-04 16:39:17,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:17,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:17,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:17,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:17,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:17,416 INFO 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-03-04 16:39:17,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:17,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:17,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:17,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:17,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:17,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:17,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:17,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,510 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:17,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:17,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,543 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:17,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:17,561 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,569 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,579 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,589 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,599 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,618 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,618 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:17,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:17,676 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,695 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,695 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:17,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,730 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:17,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,749 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:17,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:17,795 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,842 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,843 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:17,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,873 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:17,880 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:17,880 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:17,900 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:17,901 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:17,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:17,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:39:17,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:17,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:39:17,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:39:17,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:17,991 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-03-04 16:39:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:18,727 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-03-04 16:39:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:18,728 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:39:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:18,729 INFO L225 Difference]: With dead ends: 136 [2019-03-04 16:39:18,729 INFO L226 Difference]: Without dead ends: 131 [2019-03-04 16:39:18,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:39:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-03-04 16:39:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-03-04 16:39:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-03-04 16:39:18,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-03-04 16:39:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:18,756 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-03-04 16:39:18,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:39:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-03-04 16:39:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:18,757 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:18,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:18,757 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:18,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:18,757 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-03-04 16:39:18,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:18,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:18,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:18,938 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:39:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:19,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:19,061 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-03-04 16:39:19,062 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:19,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:19,064 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:19,065 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:19,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:19,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:19,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:19,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:19,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:19,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:19,087 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:19,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:19,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:19,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:19,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:19,124 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,134 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,144 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,154 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,164 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,182 INFO L309 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-03-04 16:39:19,182 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:19,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:19,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,236 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:19,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:19,267 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,284 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:19,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:19,321 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:19,322 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:19,341 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:19,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,362 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:19,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:19,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:19,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:19,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:19,421 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-03-04 16:39:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:19,925 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-03-04 16:39:19,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:19,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:19,927 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:39:19,927 INFO L226 Difference]: Without dead ends: 105 [2019-03-04 16:39:19,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-03-04 16:39:19,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-03-04 16:39:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-03-04 16:39:19,950 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-03-04 16:39:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:19,950 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-03-04 16:39:19,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-03-04 16:39:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:19,950 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:19,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:19,951 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:19,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-03-04 16:39:19,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:19,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:19,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:20,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:20,122 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:20,123 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-03-04 16:39:20,123 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:20,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:20,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:20,126 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:20,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:20,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:20,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 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-03-04 16:39:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:20,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:20,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:20,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:20,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:20,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:20,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,160 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:20,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:20,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:20,230 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,239 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,249 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,260 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,279 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,298 INFO L309 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-03-04 16:39:20,299 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:20,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,336 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:20,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,356 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,356 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:20,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,393 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:20,393 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,410 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:20,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:20,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,508 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:20,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:20,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:20,544 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:20,563 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:20,564 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:20,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:20,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:20,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:20,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:20,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:20,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:20,684 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-03-04 16:39:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:21,428 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-03-04 16:39:21,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:21,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:21,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:21,431 INFO L225 Difference]: With dead ends: 131 [2019-03-04 16:39:21,431 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:39:21,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:39:21,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-03-04 16:39:21,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-03-04 16:39:21,452 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-03-04 16:39:21,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:21,452 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-03-04 16:39:21,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:21,452 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-03-04 16:39:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:21,453 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:21,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:21,453 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:21,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-03-04 16:39:21,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:21,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:21,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:21,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:21,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:21,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:21,542 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-03-04 16:39:21,543 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:21,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:21,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:21,546 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:21,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:21,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:21,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:21,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 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-03-04 16:39:21,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:21,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:21,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:21,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:21,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:21,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:21,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:39:21,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,635 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:39:21,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,658 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:39:21,659 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,668 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,678 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,688 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,698 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,711 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:21,711 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:39:21,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,740 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:21,741 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,750 INFO L309 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-03-04 16:39:21,751 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:21,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:21,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:39:21,768 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:21,778 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:21,779 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:39:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:21,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:21,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:21,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:21,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:21,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:21,833 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-03-04 16:39:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:22,067 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-03-04 16:39:22,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:22,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:22,069 INFO L225 Difference]: With dead ends: 93 [2019-03-04 16:39:22,069 INFO L226 Difference]: Without dead ends: 92 [2019-03-04 16:39:22,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-03-04 16:39:22,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-03-04 16:39:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-03-04 16:39:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-03-04 16:39:22,091 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-03-04 16:39:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:22,092 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-03-04 16:39:22,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-03-04 16:39:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:22,092 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:22,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:22,093 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,093 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-03-04 16:39:22,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:22,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:22,315 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:22,316 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-03-04 16:39:22,316 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:22,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:22,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:22,320 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:22,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:22,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:22,321 INFO 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-03-04 16:39:22,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:22,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:22,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:22,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:22,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:22,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,342 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:22,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,356 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:22,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:22,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,384 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:22,385 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,394 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,404 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,414 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,425 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,443 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,443 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:22,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:22,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,497 INFO L309 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-03-04 16:39:22,497 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:22,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,531 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:22,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,549 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:22,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:22,584 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,603 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,603 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:22,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:22,641 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:39:22,642 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:22,661 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:22,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:39:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,700 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:22,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:22,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:22,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:22,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:22,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:22,785 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-03-04 16:39:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:23,676 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-03-04 16:39:23,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:23,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:23,678 INFO L225 Difference]: With dead ends: 117 [2019-03-04 16:39:23,678 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:39:23,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:39:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:39:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-03-04 16:39:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:39:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-03-04 16:39:23,707 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-03-04 16:39:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-03-04 16:39:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-03-04 16:39:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:23,708 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:23,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:23,708 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-03-04 16:39:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:23,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:23,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:24,462 WARN L181 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:39:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:24,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:24,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:24,632 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-03-04 16:39:24,633 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:24,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:24,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:24,636 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:24,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:24,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:24,637 INFO 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-03-04 16:39:24,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:24,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:24,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:24,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:24,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:24,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:24,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,692 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:24,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,708 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:24,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:24,737 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,746 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,757 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,767 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,793 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,807 INFO L309 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-03-04 16:39:24,807 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:24,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,849 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:24,850 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,865 INFO L309 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-03-04 16:39:24,865 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:24,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:24,892 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,906 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:24,907 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:24,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:24,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:24,935 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:24,952 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:24,953 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:24,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:25,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:25,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:25,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:25,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:25,026 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-03-04 16:39:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:25,491 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-03-04 16:39:25,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:25,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:25,493 INFO L225 Difference]: With dead ends: 99 [2019-03-04 16:39:25,493 INFO L226 Difference]: Without dead ends: 98 [2019-03-04 16:39:25,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-03-04 16:39:25,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-03-04 16:39:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:39:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-03-04 16:39:25,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-03-04 16:39:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:25,515 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-03-04 16:39:25,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-03-04 16:39:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:25,515 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:25,516 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-03-04 16:39:25,516 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:25,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-03-04 16:39:25,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:25,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:25,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:25,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:25,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:25,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:25,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:25,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 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-03-04 16:39:25,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:25,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:25,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:25,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:25,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:25,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:25,699 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:25,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,704 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:25,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,716 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:25,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,739 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:25,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:25,760 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,770 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,781 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,792 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,802 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,821 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:25,822 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:25,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,914 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:25,914 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,934 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:25,934 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:25,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:25,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:25,973 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:25,993 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:25,993 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:26,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,028 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:26,028 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:26,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:26,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:26,084 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:26,085 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:26,105 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:26,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:26,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:26,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:39:26,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:26,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:39:26,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:39:26,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:26,205 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-03-04 16:39:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:26,935 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-03-04 16:39:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:26,936 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-03-04 16:39:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:26,937 INFO L225 Difference]: With dead ends: 132 [2019-03-04 16:39:26,938 INFO L226 Difference]: Without dead ends: 130 [2019-03-04 16:39:26,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:39:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-03-04 16:39:26,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-03-04 16:39:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-03-04 16:39:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-03-04 16:39:26,975 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-03-04 16:39:26,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:26,976 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-03-04 16:39:26,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:39:26,976 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-03-04 16:39:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:26,976 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:26,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:26,977 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-03-04 16:39:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:26,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:26,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:26,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:26,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,306 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-03-04 16:39:27,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-03-04 16:39:27,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:27,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:27,333 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-03-04 16:39:27,334 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:27,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:27,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:27,337 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:27,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:27,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:27,337 INFO 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-03-04 16:39:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:27,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:27,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:27,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:27,358 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:27,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:27,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:27,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,403 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:27,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,418 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:27,418 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,428 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,438 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,447 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,457 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,602 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:27,602 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:27,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,637 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:27,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,657 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:27,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:27,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:27,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:27,688 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:27,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:27,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:27,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:27,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:27,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:27,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:27,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:27,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:27,772 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-03-04 16:39:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:28,113 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-03-04 16:39:28,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:28,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:28,114 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:39:28,115 INFO L226 Difference]: Without dead ends: 86 [2019-03-04 16:39:28,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-03-04 16:39:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-03-04 16:39:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:39:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-03-04 16:39:28,154 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-03-04 16:39:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:28,154 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-03-04 16:39:28,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-03-04 16:39:28,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:28,155 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:28,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:28,155 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:28,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,155 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-03-04 16:39:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:28,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:28,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:28,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:28,292 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-03-04 16:39:28,293 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:28,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:28,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:28,296 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:28,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:28,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:28,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-03-04 16:39:28,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:28,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:28,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:28,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:28,314 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:28,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:28,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:28,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:28,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:28,410 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,421 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,431 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,442 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,452 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,471 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,471 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:28,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,503 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:28,504 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,522 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,522 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:28,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:28,553 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,573 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,573 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:28,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:28,604 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:28,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:28,624 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:28,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:28,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:28,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:28,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:28,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:28,688 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-03-04 16:39:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:29,205 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-03-04 16:39:29,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:29,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:29,207 INFO L225 Difference]: With dead ends: 106 [2019-03-04 16:39:29,207 INFO L226 Difference]: Without dead ends: 105 [2019-03-04 16:39:29,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-03-04 16:39:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-03-04 16:39:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-03-04 16:39:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-03-04 16:39:29,243 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-03-04 16:39:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:29,243 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-03-04 16:39:29,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-03-04 16:39:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:29,244 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:29,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:29,244 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-03-04 16:39:29,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:29,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:29,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:29,419 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:39:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:29,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:29,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:29,492 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-03-04 16:39:29,493 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:29,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:29,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:29,497 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:29,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:29,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:29,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:29,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:29,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:29,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:29,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:29,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:29,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,522 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:29,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:29,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,538 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:29,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,554 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:29,554 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,564 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,575 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,585 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,598 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,616 INFO L309 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-03-04 16:39:29,617 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:29,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:29,652 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,683 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,684 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:29,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:29,718 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,736 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:29,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:29,773 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:29,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:29,793 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:29,793 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:29,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-03-04 16:39:29,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:29,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:29,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:29,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:29,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:29,873 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-03-04 16:39:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:30,412 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-03-04 16:39:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:30,413 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:30,414 INFO L225 Difference]: With dead ends: 102 [2019-03-04 16:39:30,414 INFO L226 Difference]: Without dead ends: 101 [2019-03-04 16:39:30,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:30,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-03-04 16:39:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-03-04 16:39:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:39:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-03-04 16:39:30,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-03-04 16:39:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:30,450 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-03-04 16:39:30,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-03-04 16:39:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:30,450 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:30,450 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:30,450 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,451 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-03-04 16:39:30,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:30,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:30,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:30,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:30,528 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-03-04 16:39:30,529 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:30,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:30,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:30,532 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:30,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:30,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:30,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:30,533 INFO 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-03-04 16:39:30,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:30,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:30,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:30,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:30,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:30,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:30,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:30,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:30,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:30,644 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,654 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,665 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,675 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,685 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,701 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,702 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:30,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:30,745 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,759 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,759 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:30,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:30,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:30,783 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:30,798 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:30,798 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:30,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:30,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:30,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:30,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:30,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:30,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:30,860 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-03-04 16:39:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:31,132 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-03-04 16:39:31,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:31,133 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:31,134 INFO L225 Difference]: With dead ends: 94 [2019-03-04 16:39:31,134 INFO L226 Difference]: Without dead ends: 93 [2019-03-04 16:39:31,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-03-04 16:39:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-03-04 16:39:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-03-04 16:39:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-03-04 16:39:31,165 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-03-04 16:39:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:31,165 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-03-04 16:39:31,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-03-04 16:39:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:31,166 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:31,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:31,166 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,166 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-03-04 16:39:31,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:31,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,412 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-03-04 16:39:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:31,458 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:31,458 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-03-04 16:39:31,459 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:31,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:31,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:31,461 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:31,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:31,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:31,462 INFO 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-03-04 16:39:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:31,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:31,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:31,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:31,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:31,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:31,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,508 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:31,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,523 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:31,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,542 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:31,543 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,553 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,564 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,574 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,584 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,601 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,601 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:31,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:31,646 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,661 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:31,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,689 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:31,690 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:39:31,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:31,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:39:31,731 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:31,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:31,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:39:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:31,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:31,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:31,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:31,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:31,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:31,814 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-03-04 16:39:32,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:32,206 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-03-04 16:39:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:32,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:32,208 INFO L225 Difference]: With dead ends: 116 [2019-03-04 16:39:32,208 INFO L226 Difference]: Without dead ends: 115 [2019-03-04 16:39:32,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-03-04 16:39:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-03-04 16:39:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-03-04 16:39:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-03-04 16:39:32,238 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-03-04 16:39:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:32,239 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-03-04 16:39:32,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-03-04 16:39:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:32,239 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:32,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:32,239 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-03-04 16:39:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:32,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:32,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:32,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:32,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:32,417 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-03-04 16:39:32,418 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:32,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:32,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:32,421 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:32,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:32,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:32,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:32,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:32,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:32,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:32,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:32,445 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:32,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:32,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:32,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,474 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:32,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:32,496 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,505 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,516 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,526 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,536 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,555 INFO L309 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-03-04 16:39:32,555 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:32,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:32,593 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,612 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:32,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:32,647 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,667 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:32,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:32,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,767 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,768 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:32,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:32,926 INFO L301 Elim1Store]: Index analysis took 105 ms [2019-03-04 16:39:32,926 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:32,926 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:32,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:32,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:32,969 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:33,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:33,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:33,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:33,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:33,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:33,042 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-03-04 16:39:33,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:33,943 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-03-04 16:39:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:33,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:33,945 INFO L225 Difference]: With dead ends: 140 [2019-03-04 16:39:33,946 INFO L226 Difference]: Without dead ends: 139 [2019-03-04 16:39:33,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-03-04 16:39:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-03-04 16:39:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-03-04 16:39:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-03-04 16:39:33,982 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-03-04 16:39:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:33,982 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-03-04 16:39:33,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-03-04 16:39:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:33,983 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:33,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:33,983 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-03-04 16:39:33,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:33,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:33,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:33,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:34,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:34,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:34,103 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-03-04 16:39:34,104 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:34,104 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:34,108 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:34,108 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:34,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,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 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-03-04 16:39:34,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:34,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:34,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:34,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:34,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:34,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:34,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:39:34,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,206 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:39:34,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,242 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:39:34,243 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,256 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,268 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,280 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,292 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,308 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:34,308 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:39:34,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:34,352 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:34,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:34,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:39:34,397 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,405 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:34,406 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:39:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:34,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:34,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:34,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:34,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:34,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:34,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:34,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:34,450 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-03-04 16:39:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:34,708 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-03-04 16:39:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:34,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:34,710 INFO L225 Difference]: With dead ends: 112 [2019-03-04 16:39:34,711 INFO L226 Difference]: Without dead ends: 111 [2019-03-04 16:39:34,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-03-04 16:39:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-03-04 16:39:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:39:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-03-04 16:39:34,758 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-03-04 16:39:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:34,758 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-03-04 16:39:34,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-03-04 16:39:34,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:34,759 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:34,759 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:34,759 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-03-04 16:39:34,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:34,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:34,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:34,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:34,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:34,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:34,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:34,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:34,921 INFO 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-03-04 16:39:34,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:34,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:34,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:34,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:34,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:34,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:34,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:34,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:34,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:34,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,966 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:34,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:34,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:34,981 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:34,991 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,001 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,011 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,019 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,038 INFO L309 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-03-04 16:39:35,039 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:35,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:35,107 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,126 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,126 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:35,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,224 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:35,225 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,244 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:35,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:35,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,301 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,301 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:35,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:35,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:35,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:35,356 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:35,357 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:35,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:35,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:35,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:35,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:35,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:35,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:35,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:35,462 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-03-04 16:39:36,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:36,372 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-03-04 16:39:36,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:36,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:36,374 INFO L225 Difference]: With dead ends: 137 [2019-03-04 16:39:36,374 INFO L226 Difference]: Without dead ends: 135 [2019-03-04 16:39:36,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-03-04 16:39:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-03-04 16:39:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-03-04 16:39:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-03-04 16:39:36,410 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-03-04 16:39:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:36,411 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-03-04 16:39:36,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-03-04 16:39:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:36,411 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:36,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:36,412 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-03-04 16:39:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:36,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:36,931 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:39:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:37,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:37,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:37,067 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-03-04 16:39:37,068 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:37,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:37,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:37,070 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:37,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:37,071 INFO 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-03-04 16:39:37,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:37,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:37,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:37,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:37,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,097 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:37,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:37,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,114 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:37,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,128 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:37,129 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,139 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,148 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,158 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,168 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,187 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,187 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:37,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:37,218 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,233 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,234 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:37,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,265 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:37,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,284 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:37,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:37,318 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:37,318 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:37,338 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:37,338 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:37,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:37,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:37,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:37,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:37,401 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-03-04 16:39:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:37,902 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-03-04 16:39:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:37,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:37,904 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:39:37,905 INFO L226 Difference]: Without dead ends: 123 [2019-03-04 16:39:37,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-03-04 16:39:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-03-04 16:39:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:39:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-03-04 16:39:37,949 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-03-04 16:39:37,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:37,949 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-03-04 16:39:37,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-03-04 16:39:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:37,950 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:37,950 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:37,950 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-03-04 16:39:37,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:37,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:38,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:38,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:38,073 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:38,073 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-03-04 16:39:38,074 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:38,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:38,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:38,077 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:38,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:38,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:38,078 INFO 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-03-04 16:39:38,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:38,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:38,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:38,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:38,098 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:38,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:38,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:38,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:38,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,134 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:38,135 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,144 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,155 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,165 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,175 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,194 INFO L309 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-03-04 16:39:38,194 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:38,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,227 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:38,227 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,246 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:38,246 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:38,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:38,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,301 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:38,301 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:38,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:38,335 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:38,335 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:38,355 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:38,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:38,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:38,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:38,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:39:38,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:38,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:38,443 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-03-04 16:39:38,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:38,954 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-03-04 16:39:38,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:38,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:39:38,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:38,956 INFO L225 Difference]: With dead ends: 119 [2019-03-04 16:39:38,956 INFO L226 Difference]: Without dead ends: 118 [2019-03-04 16:39:38,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-03-04 16:39:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-03-04 16:39:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-03-04 16:39:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-03-04 16:39:39,001 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-03-04 16:39:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:39,001 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-03-04 16:39:39,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-03-04 16:39:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:39,002 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:39,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:39,002 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-03-04 16:39:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:39,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:39,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:39,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:39,149 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-03-04 16:39:39,151 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:39,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:39,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:39,153 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:39,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:39,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:39,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:39,154 INFO 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-03-04 16:39:39,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:39,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:39,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:39,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:39,177 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:39,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:39,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:39,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,207 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:39,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,230 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:39,230 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,245 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,257 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,269 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,283 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,304 INFO L309 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-03-04 16:39:39,304 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:39,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:39,351 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,367 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:39,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:39,400 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,419 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,419 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:39,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:39,452 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,471 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,471 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:39,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:39,518 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:39,519 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:39,535 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:39,536 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:39,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:39,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:39,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:39,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:39,614 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-03-04 16:39:40,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:40,579 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-03-04 16:39:40,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:40,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:40,581 INFO L225 Difference]: With dead ends: 149 [2019-03-04 16:39:40,581 INFO L226 Difference]: Without dead ends: 148 [2019-03-04 16:39:40,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:39:40,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-03-04 16:39:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-03-04 16:39:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:39:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-03-04 16:39:40,632 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-03-04 16:39:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:40,632 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-03-04 16:39:40,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-03-04 16:39:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:40,633 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:40,633 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:40,633 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-03-04 16:39:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:40,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:40,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:40,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:40,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:40,732 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-03-04 16:39:40,733 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:40,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:40,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:40,736 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:40,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:40,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:40,737 INFO 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-03-04 16:39:40,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:40,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:40,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:40,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:40,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:40,785 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:40,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,804 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:40,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:40,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,838 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:40,839 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,848 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,858 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,868 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,877 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,893 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:40,894 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:40,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:40,931 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,943 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:40,943 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:40,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:40,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:40,967 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:40,981 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:40,982 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:41,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:41,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,021 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:41,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:39:41,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:41,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:41,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:39:41,093 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-03-04 16:39:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:41,589 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-03-04 16:39:41,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:41,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:41,591 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:39:41,591 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:39:41,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:41,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:39:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-03-04 16:39:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:39:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-03-04 16:39:41,643 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-03-04 16:39:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:41,643 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-03-04 16:39:41,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-03-04 16:39:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:41,644 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:41,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:41,644 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:41,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:41,644 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-03-04 16:39:41,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:41,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:41,805 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:39:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:41,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:41,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:41,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:41,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:41,881 INFO 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-03-04 16:39:41,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:41,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:41,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:41,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:41,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:41,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:41,902 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:41,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:41,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,910 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:41,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:41,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,925 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:41,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:41,935 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,946 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,955 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,965 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,975 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:41,994 INFO L309 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-03-04 16:39:41,994 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:42,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,202 INFO L301 Elim1Store]: Index analysis took 150 ms [2019-03-04 16:39:42,203 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:42,203 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,223 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,223 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:42,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:42,269 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,288 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,288 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:42,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,325 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:42,326 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,345 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,345 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:42,375 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:42,386 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:42,387 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:42,406 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:42,407 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:42,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:42,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:42,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:42,509 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-03-04 16:39:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:43,333 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-03-04 16:39:43,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:43,334 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:43,336 INFO L225 Difference]: With dead ends: 164 [2019-03-04 16:39:43,336 INFO L226 Difference]: Without dead ends: 163 [2019-03-04 16:39:43,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:43,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-03-04 16:39:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-03-04 16:39:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-03-04 16:39:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-03-04 16:39:43,388 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-03-04 16:39:43,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:43,388 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-03-04 16:39:43,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-03-04 16:39:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:43,388 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:43,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:43,389 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-03-04 16:39:43,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:43,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:43,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:43,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:43,482 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-03-04 16:39:43,482 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:43,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:43,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:43,485 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:43,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:43,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:43,486 INFO 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-03-04 16:39:43,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:43,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:43,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:43,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:43,507 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:43,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,511 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:43,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,519 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:43,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:43,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,546 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:43,546 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,556 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,566 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,576 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,586 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,604 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,604 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:43,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:43,637 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,655 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,656 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:43,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:43,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:43,688 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:43,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:43,708 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:43,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:43,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:43,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:43,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:43,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:43,791 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-03-04 16:39:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:44,170 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-03-04 16:39:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:44,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:44,172 INFO L225 Difference]: With dead ends: 122 [2019-03-04 16:39:44,172 INFO L226 Difference]: Without dead ends: 121 [2019-03-04 16:39:44,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:44,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-03-04 16:39:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-03-04 16:39:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-03-04 16:39:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-03-04 16:39:44,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-03-04 16:39:44,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:44,230 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-03-04 16:39:44,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:44,230 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-03-04 16:39:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:44,230 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:44,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:44,231 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-03-04 16:39:44,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:44,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:44,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:44,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:44,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:44,421 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-03-04 16:39:44,422 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:44,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:44,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:44,425 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:39:44,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:44,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:44,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:44,426 INFO 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-03-04 16:39:44,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:44,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:44,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:44,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:44,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:44,454 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:44,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:44,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,472 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:44,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,496 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:44,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,549 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:44,549 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,558 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,570 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,582 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,595 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,618 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,618 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:44,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,667 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:44,667 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:44,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,717 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:44,717 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,735 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,736 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:44,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:44,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:44,767 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:44,786 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:44,787 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:44,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:44,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:44,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:44,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:44,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:44,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:44,847 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-03-04 16:39:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:45,398 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-03-04 16:39:45,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:45,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:45,401 INFO L225 Difference]: With dead ends: 154 [2019-03-04 16:39:45,401 INFO L226 Difference]: Without dead ends: 153 [2019-03-04 16:39:45,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-03-04 16:39:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-03-04 16:39:45,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-03-04 16:39:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-03-04 16:39:45,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-03-04 16:39:45,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:45,463 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-03-04 16:39:45,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:45,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-03-04 16:39:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:45,464 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:45,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:45,464 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:45,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,465 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-03-04 16:39:45,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:45,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:45,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:45,548 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:45,548 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-03-04 16:39:45,549 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:45,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:45,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:45,552 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:45,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:45,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:45,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:45,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:45,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:45,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:45,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:45,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:45,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:45,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:45,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,599 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:45,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:45,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:45,638 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,649 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,726 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,734 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,745 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,761 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,761 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:45,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:45,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,815 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,815 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:45,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:45,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:45,842 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:45,857 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:45,857 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:45,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:45,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:45,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:45,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:45,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:45,921 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-03-04 16:39:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:46,259 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-03-04 16:39:46,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:39:46,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:46,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:46,261 INFO L225 Difference]: With dead ends: 130 [2019-03-04 16:39:46,261 INFO L226 Difference]: Without dead ends: 129 [2019-03-04 16:39:46,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-03-04 16:39:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-03-04 16:39:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-03-04 16:39:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-03-04 16:39:46,322 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-03-04 16:39:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:46,322 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-03-04 16:39:46,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-03-04 16:39:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:46,322 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:46,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:46,323 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:46,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-03-04 16:39:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:46,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:46,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:46,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:46,773 WARN L181 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:39:46,921 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-03-04 16:39:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:46,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:46,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:46,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:46,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:46,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:46,935 INFO 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-03-04 16:39:46,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:46,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:46,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:46,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:46,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:39:46,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:46,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:46,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,964 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:46,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:46,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:46,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:46,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,003 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:47,003 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,014 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,024 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,033 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,044 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,064 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:47,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,097 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:47,098 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,117 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,118 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:47,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:47,152 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,171 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:47,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:47,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:47,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:47,230 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:47,230 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:47,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:47,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:39:47,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:47,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:39:47,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:39:47,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:47,303 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-03-04 16:39:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:47,838 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-03-04 16:39:47,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:47,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-03-04 16:39:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:47,841 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:39:47,841 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:39:47,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:39:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-03-04 16:39:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-03-04 16:39:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-03-04 16:39:47,912 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-03-04 16:39:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:47,912 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-03-04 16:39:47,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:39:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-03-04 16:39:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:47,912 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:47,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:47,913 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-03-04 16:39:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:47,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:47,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:47,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:47,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:48,020 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:48,021 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-03-04 16:39:48,023 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:48,023 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:48,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:48,027 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:39:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:48,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:48,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,027 INFO 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-03-04 16:39:48,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:48,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:48,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:48,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:48,055 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:48,072 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:48,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:48,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:48,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:48,126 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,137 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,147 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,158 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,169 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,184 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,185 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:48,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,221 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:48,222 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,237 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,237 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,254 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:39:48,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-03-04 16:39:48,282 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:39:48,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:39:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:39:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:48,283 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-03-04 16:39:48,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:48,376 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-03-04 16:39:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:39:48,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-03-04 16:39:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:48,378 INFO L225 Difference]: With dead ends: 121 [2019-03-04 16:39:48,379 INFO L226 Difference]: Without dead ends: 117 [2019-03-04 16:39:48,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:39:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-03-04 16:39:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-03-04 16:39:48,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-03-04 16:39:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-03-04 16:39:48,444 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-03-04 16:39:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:48,444 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-03-04 16:39:48,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:39:48,444 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-03-04 16:39:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:48,444 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:48,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:48,445 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-03-04 16:39:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:48,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:48,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:48,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:48,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:48,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:48,628 INFO 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-03-04 16:39:48,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:48,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:48,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:48,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:48,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:48,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:48,648 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:48,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:48,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:48,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:48,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:48,688 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,704 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,714 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,724 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,734 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,753 INFO L309 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-03-04 16:39:48,754 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:48,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:48,799 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,818 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:48,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,856 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:48,857 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,876 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,877 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:48,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:48,925 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:48,945 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:48,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:48,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:48,981 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:48,981 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:49,001 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:49,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:49,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-03-04 16:39:49,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:49,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:49,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:49,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:49,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:49,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:49,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:49,099 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-03-04 16:39:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:50,082 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-03-04 16:39:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:50,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:50,085 INFO L225 Difference]: With dead ends: 186 [2019-03-04 16:39:50,086 INFO L226 Difference]: Without dead ends: 184 [2019-03-04 16:39:50,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-03-04 16:39:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-03-04 16:39:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:39:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-03-04 16:39:50,178 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-03-04 16:39:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:50,178 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-03-04 16:39:50,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-03-04 16:39:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:50,178 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:50,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:50,179 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-03-04 16:39:50,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:50,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:50,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:50,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:50,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:50,347 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-03-04 16:39:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:50,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:50,372 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-03-04 16:39:50,373 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-03-04 16:39:50,373 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:50,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:50,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:50,376 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:50,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:50,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:50,376 INFO 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-03-04 16:39:50,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:50,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:50,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:39:50,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:50,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:50,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:50,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,419 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:50,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:50,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:50,456 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,465 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,475 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,486 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,495 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:50,513 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:50,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,547 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:50,547 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,562 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:50,562 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:50,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:50,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:50,639 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:50,654 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:50,654 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:50,672 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:50,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:50,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:39:50,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:50,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:50,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:50,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:39:50,704 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-03-04 16:39:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:51,049 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-03-04 16:39:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:51,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:51,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:51,051 INFO L225 Difference]: With dead ends: 161 [2019-03-04 16:39:51,052 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:39:51,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:39:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-03-04 16:39:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:39:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-03-04 16:39:51,138 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-03-04 16:39:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:51,138 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-03-04 16:39:51,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-03-04 16:39:51,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:51,138 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:51,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:51,139 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-03-04 16:39:51,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:51,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:51,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:51,379 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-03-04 16:39:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:51,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:51,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:51,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:51,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:51,404 INFO 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-03-04 16:39:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:51,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:51,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-03-04 16:39:51,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:51,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:39:51,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:51,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:51,432 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:51,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:39:51,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,468 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:39:51,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,491 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:39:51,492 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,501 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,511 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,521 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,531 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,546 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:51,546 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:39:51,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:51,577 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,587 INFO L309 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-03-04 16:39:51,588 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:39:51,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:51,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:39:51,607 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:51,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:51,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:39:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:51,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:51,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:51,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:51,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:51,670 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-03-04 16:39:52,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:52,007 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-03-04 16:39:52,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:52,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-03-04 16:39:52,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:52,009 INFO L225 Difference]: With dead ends: 172 [2019-03-04 16:39:52,010 INFO L226 Difference]: Without dead ends: 170 [2019-03-04 16:39:52,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:39:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-03-04 16:39:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-03-04 16:39:52,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:39:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-03-04 16:39:52,120 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-03-04 16:39:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:52,120 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-03-04 16:39:52,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-03-04 16:39:52,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:52,121 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:52,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:52,121 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-03-04 16:39:52,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:52,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:52,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:52,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:52,273 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:39:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:52,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:52,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:52,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:52,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:52,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:52,366 INFO 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-03-04 16:39:52,375 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:39:52,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:39:52,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:39:52,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:52,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:52,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:52,390 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:52,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,436 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:52,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,441 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:52,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,452 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:52,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,467 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:52,467 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,478 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,488 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,498 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,509 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,528 INFO L309 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-03-04 16:39:52,528 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:52,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:52,570 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,589 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:52,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:52,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,627 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:52,628 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,647 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:52,647 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:39:52,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:52,764 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,837 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:52,838 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:52,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:52,872 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:52,872 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:52,892 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:52,893 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:52,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:52,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:52,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:39:52,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:52,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:52,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:52,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:39:53,000 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-03-04 16:39:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:53,829 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-03-04 16:39:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:53,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-03-04 16:39:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:53,832 INFO L225 Difference]: With dead ends: 209 [2019-03-04 16:39:53,832 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:39:53,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:53,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:39:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-03-04 16:39:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:39:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-03-04 16:39:53,909 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-03-04 16:39:53,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:53,909 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-03-04 16:39:53,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:53,909 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-03-04 16:39:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:39:53,909 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:53,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:39:53,910 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:53,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-03-04 16:39:53,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:53,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:53,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:54,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:54,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:39:54,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:39:54,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:54,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 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-03-04 16:39:54,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:39:54,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:39:54,095 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:39:54,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:39:54,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:39:54,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:54,101 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:54,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:54,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,126 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:39:54,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:39:54,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,176 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:39:54,176 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,185 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,195 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,205 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,216 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,233 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,233 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:39:54,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,268 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:54,268 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,283 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:39:54,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:39:54,311 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,327 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:39:54,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:54,351 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:39:54,352 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:54,366 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:54,367 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:39:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:54,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:54,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:39:54,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:54,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:39:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:39:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:39:54,468 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-03-04 16:39:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:55,045 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-03-04 16:39:55,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:39:55,046 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-03-04 16:39:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:55,048 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:39:55,048 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:39:55,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:39:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:39:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-03-04 16:39:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:39:55,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-03-04 16:39:55,136 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-03-04 16:39:55,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:55,136 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-03-04 16:39:55,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:39:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-03-04 16:39:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:55,137 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:55,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:55,137 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-03-04 16:39:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:55,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:39:55,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:55,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:55,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:55,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:55,329 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-03-04 16:39:55,330 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:55,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:55,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:55,334 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:55,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:55,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:55,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:55,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:55,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:55,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:55,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:55,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:55,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,355 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:55,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:55,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:55,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,391 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:55,391 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,418 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,427 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,438 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,448 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,467 INFO L309 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-03-04 16:39:55,468 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:55,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,500 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:55,501 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,520 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,520 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:55,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:55,551 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,571 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:55,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:55,606 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,626 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:55,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:55,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:55,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:55,685 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:55,686 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:39:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:55,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:55,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:39:55,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:55,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:39:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:39:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:55,931 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-03-04 16:39:56,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:56,760 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-03-04 16:39:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:39:56,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:39:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:56,763 INFO L225 Difference]: With dead ends: 189 [2019-03-04 16:39:56,763 INFO L226 Difference]: Without dead ends: 188 [2019-03-04 16:39:56,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-03-04 16:39:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-03-04 16:39:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:39:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-03-04 16:39:56,859 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-03-04 16:39:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:56,859 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-03-04 16:39:56,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:39:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-03-04 16:39:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:56,859 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:56,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:56,859 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-03-04 16:39:56,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:56,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:56,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,018 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2019-03-04 16:39:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:39:57,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:57,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:57,118 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-03-04 16:39:57,119 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:57,119 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:57,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:57,121 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:39:57,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:57,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:57,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:57,122 INFO 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-03-04 16:39:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:57,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:57,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:39:57,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:57,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:57,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:57,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,153 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:57,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,167 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:57,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:57,216 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,224 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,234 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,245 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,253 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,272 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,272 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:39:57,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,309 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:39:57,309 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,329 INFO L309 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-03-04 16:39:57,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:39:57,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,367 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:57,367 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,387 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,387 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:57,413 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,424 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:57,424 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,444 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,444 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:57,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:57,480 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:39:57,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:57,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:57,500 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:39:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:57,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:57,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:39:57,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:57,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:39:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:39:57,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:39:57,601 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-03-04 16:39:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:58,384 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-03-04 16:39:58,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:39:58,385 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:39:58,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:58,387 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:39:58,387 INFO L226 Difference]: Without dead ends: 168 [2019-03-04 16:39:58,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:39:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-03-04 16:39:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-03-04 16:39:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-03-04 16:39:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-03-04 16:39:58,479 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-03-04 16:39:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:58,479 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-03-04 16:39:58,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:39:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-03-04 16:39:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:58,479 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:58,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:58,480 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-03-04 16:39:58,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:58,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:58,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:58,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:58,567 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-03-04 16:39:58,569 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:58,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:58,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:58,572 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:39:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:58,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:58,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:58,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:58,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:58,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:39:58,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:58,593 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:58,611 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:39:58,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:39:58,655 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:39:58,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:58,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:39:58,686 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,694 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,704 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,712 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,721 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,732 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:39:58,733 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-03-04 16:39:58,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:58,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:39:58,755 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,759 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,760 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:16 [2019-03-04 16:39:58,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:58,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-03-04 16:39:58,772 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:58,778 INFO L309 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-03-04 16:39:58,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-03-04 16:39:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:39:58,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:58,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:39:58,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:39:58,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:39:58,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:39:58,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:39:58,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:39:58,830 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-03-04 16:39:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:39:59,103 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-03-04 16:39:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:39:59,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:39:59,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:39:59,105 INFO L225 Difference]: With dead ends: 159 [2019-03-04 16:39:59,105 INFO L226 Difference]: Without dead ends: 158 [2019-03-04 16:39:59,106 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-03-04 16:39:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-03-04 16:39:59,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-03-04 16:39:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:39:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-03-04 16:39:59,193 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-03-04 16:39:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:39:59,193 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-03-04 16:39:59,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:39:59,193 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-03-04 16:39:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:39:59,194 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:39:59,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:39:59,194 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:39:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-03-04 16:39:59,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:39:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:39:59,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:39:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,602 WARN L181 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-03-04 16:39:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:39:59,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:39:59,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:39:59,804 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-03-04 16:39:59,804 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:39:59,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:39:59,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:39:59,806 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:39:59,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:39:59,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:39:59,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:39:59,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:39:59,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:39:59,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:39:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:39:59,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:39:59,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:39:59,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:39:59,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,837 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:39:59,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,860 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:39:59,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,878 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:39:59,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:39:59,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:39:59,905 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,924 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,938 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,951 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,967 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,999 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:39:59,999 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:00,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,034 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,037 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,038 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,039 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,042 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:00,042 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,060 INFO L309 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-03-04 16:40:00,060 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:00,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,094 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:00,094 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,113 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:00,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:00,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:00,149 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,168 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:00,168 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:00,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,201 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:00,201 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,220 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:00,220 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:00,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,266 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,267 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:00,274 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:00,275 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:00,294 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:00,294 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,315 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:00,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:00,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:40:00,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:00,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:40:00,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:40:00,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:00,404 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-03-04 16:40:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:01,574 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-03-04 16:40:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:01,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:40:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:01,577 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:40:01,577 INFO L226 Difference]: Without dead ends: 198 [2019-03-04 16:40:01,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:40:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-03-04 16:40:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-03-04 16:40:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:40:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-03-04 16:40:01,666 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-03-04 16:40:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:01,667 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-03-04 16:40:01,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:40:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-03-04 16:40:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:01,667 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:01,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:01,668 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-03-04 16:40:01,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:01,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:01,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:01,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:01,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:01,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:01,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:01,828 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:01,828 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-03-04 16:40:01,829 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:01,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:01,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:01,832 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:01,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:01,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:01,832 INFO 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-03-04 16:40:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:01,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:01,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:01,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:01,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:01,874 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:01,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:01,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,901 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:01,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:01,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:01,922 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,929 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,939 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,950 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,960 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:01,977 INFO L309 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-03-04 16:40:01,977 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:02,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:02,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,035 INFO L309 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-03-04 16:40:02,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:02,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,066 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:02,066 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,081 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:02,081 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:40:02,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:02,110 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,125 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:02,125 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:40:02,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:02,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:40:02,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:02,169 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:02,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:40:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:02,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:40:02,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:02,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:02,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:02,266 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-03-04 16:40:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:02,938 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-03-04 16:40:02,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:02,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:02,941 INFO L225 Difference]: With dead ends: 181 [2019-03-04 16:40:02,941 INFO L226 Difference]: Without dead ends: 180 [2019-03-04 16:40:02,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:02,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-03-04 16:40:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-03-04 16:40:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-03-04 16:40:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-03-04 16:40:03,043 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-03-04 16:40:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:03,043 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-03-04 16:40:03,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-03-04 16:40:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:03,044 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:03,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:03,044 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-03-04 16:40:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:03,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:03,261 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-03-04 16:40:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:03,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:03,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:03,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:03,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:03,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:03,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:03,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:03,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:40:03,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:03,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:03,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:03,413 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:03,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:03,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:03,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,433 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:03,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,448 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:03,448 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,458 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,488 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,498 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,509 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,526 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,527 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:03,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:03,564 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,582 INFO L309 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-03-04 16:40:03,583 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:03,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,619 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:03,620 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,639 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,639 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:03,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:03,677 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,696 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:03,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,737 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:03,738 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,757 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,757 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:03,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:03,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:03,793 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:03,812 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:03,813 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:03,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:03,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:40:03,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:03,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:40:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:40:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:03,953 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-03-04 16:40:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:05,299 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-03-04 16:40:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:05,299 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:40:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:05,301 INFO L225 Difference]: With dead ends: 200 [2019-03-04 16:40:05,302 INFO L226 Difference]: Without dead ends: 199 [2019-03-04 16:40:05,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:40:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-03-04 16:40:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-03-04 16:40:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-03-04 16:40:05,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-03-04 16:40:05,394 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-03-04 16:40:05,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:05,394 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-03-04 16:40:05,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:40:05,394 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-03-04 16:40:05,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:05,395 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:05,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:05,395 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:05,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-03-04 16:40:05,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:05,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:05,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,540 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:40:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:05,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:05,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:05,610 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-03-04 16:40:05,610 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:05,610 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:05,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:05,612 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:05,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:05,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:05,613 INFO 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-03-04 16:40:05,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:05,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:05,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:05,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:05,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:05,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:05,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,640 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:05,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:05,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,664 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:05,665 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,680 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,690 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,701 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,711 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,729 INFO L309 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-03-04 16:40:05,729 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:05,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:05,762 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,780 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,780 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:05,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,812 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:05,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,832 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,832 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:05,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:05,866 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:05,866 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:05,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:05,886 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:05,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:05,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:05,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:05,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:05,966 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-03-04 16:40:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:06,560 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-03-04 16:40:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:06,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:06,562 INFO L225 Difference]: With dead ends: 160 [2019-03-04 16:40:06,562 INFO L226 Difference]: Without dead ends: 159 [2019-03-04 16:40:06,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:06,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-03-04 16:40:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-03-04 16:40:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:40:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-03-04 16:40:06,662 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-03-04 16:40:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:06,662 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-03-04 16:40:06,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-03-04 16:40:06,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:06,662 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:06,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:06,663 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-03-04 16:40:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:06,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:06,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:06,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:06,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:06,849 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-03-04 16:40:06,850 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:06,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:06,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:06,851 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:06,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:06,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:06,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:06,852 INFO 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-03-04 16:40:06,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:06,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:06,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:06,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:06,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:06,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,876 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:06,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,883 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:06,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,893 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:06,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:06,915 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:06,915 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,923 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,933 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,944 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,954 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:06,972 INFO L309 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-03-04 16:40:06,973 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:07,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,012 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:07,012 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,031 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,032 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:07,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,069 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:07,069 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,088 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:07,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,124 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:07,125 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,143 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,144 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:07,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:07,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:07,181 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:07,200 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:07,200 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:07,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:07,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:40:07,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:07,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:07,290 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-03-04 16:40:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:08,089 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-03-04 16:40:08,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:08,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:40:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:08,092 INFO L225 Difference]: With dead ends: 197 [2019-03-04 16:40:08,092 INFO L226 Difference]: Without dead ends: 196 [2019-03-04 16:40:08,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-03-04 16:40:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-03-04 16:40:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-03-04 16:40:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-03-04 16:40:08,200 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-03-04 16:40:08,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:08,200 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-03-04 16:40:08,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-03-04 16:40:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:08,201 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:08,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:08,201 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:08,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-03-04 16:40:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:08,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:08,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:08,473 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-03-04 16:40:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:08,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:08,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:08,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:08,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:08,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:08,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:08,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:08,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:08,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:08,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:08,592 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:08,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:08,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:08,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:08,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,628 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:08,628 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,723 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,733 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,744 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,754 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,773 INFO L309 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-03-04 16:40:08,774 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:08,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:08,810 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,829 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:08,829 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:08,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,864 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:08,864 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,882 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:08,882 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:08,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:08,917 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:08,936 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:08,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:08,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:08,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:08,975 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:09,008 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:09,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:09,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:40:09,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:09,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:09,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:09,115 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-03-04 16:40:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:10,019 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-03-04 16:40:10,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:10,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:10,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:10,022 INFO L225 Difference]: With dead ends: 195 [2019-03-04 16:40:10,022 INFO L226 Difference]: Without dead ends: 189 [2019-03-04 16:40:10,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-03-04 16:40:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-03-04 16:40:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-03-04 16:40:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-03-04 16:40:10,164 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-03-04 16:40:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:10,164 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-03-04 16:40:10,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-03-04 16:40:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:10,164 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:10,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:10,165 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:10,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-03-04 16:40:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:10,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:10,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:10,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:10,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:10,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:10,294 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:10,294 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-03-04 16:40:10,295 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:10,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:10,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:10,298 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:10,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:10,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:10,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:10,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:10,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:10,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:10,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:10,320 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:10,339 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:10,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,363 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:10,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,381 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:10,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,399 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:10,400 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,407 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,417 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,427 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,436 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,452 INFO L309 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-03-04 16:40:10,452 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:10,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:10,493 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,508 INFO L309 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-03-04 16:40:10,508 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:10,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:10,537 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,553 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:10,553 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:40:10,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:10,580 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:40:10,580 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:10,594 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:10,594 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:40:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:10,620 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:10,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:10,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:10,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:10,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:10,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:10,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:10,680 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-03-04 16:40:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:11,206 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-03-04 16:40:11,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:11,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:11,209 INFO L225 Difference]: With dead ends: 157 [2019-03-04 16:40:11,209 INFO L226 Difference]: Without dead ends: 156 [2019-03-04 16:40:11,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-03-04 16:40:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-03-04 16:40:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-03-04 16:40:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-03-04 16:40:11,325 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-03-04 16:40:11,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:11,326 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-03-04 16:40:11,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:11,326 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-03-04 16:40:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:11,326 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:11,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:11,326 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:11,327 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-03-04 16:40:11,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:11,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:11,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:11,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:11,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:11,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:11,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:11,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:11,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:11,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:11,539 INFO 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-03-04 16:40:11,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:11,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:11,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:11,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:11,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:11,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:11,560 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:11,569 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:11,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,583 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:11,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:11,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:11,617 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,625 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,635 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,644 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,653 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,670 INFO L309 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-03-04 16:40:11,670 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:11,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,715 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:11,716 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,731 INFO L309 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-03-04 16:40:11,731 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:11,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:11,760 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,775 INFO L309 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-03-04 16:40:11,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:40:11,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,806 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:40:11,807 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,822 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:11,822 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:40:11,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:11,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:40:11,852 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:11,867 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:11,867 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:40:11,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:11,889 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:11,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:11,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:40:11,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:11,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:11,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:11,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:11,969 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-03-04 16:40:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:12,679 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-03-04 16:40:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:12,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:12,682 INFO L225 Difference]: With dead ends: 178 [2019-03-04 16:40:12,682 INFO L226 Difference]: Without dead ends: 177 [2019-03-04 16:40:12,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-03-04 16:40:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-03-04 16:40:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-03-04 16:40:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-03-04 16:40:12,781 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-03-04 16:40:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:12,781 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-03-04 16:40:12,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-03-04 16:40:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:12,781 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:12,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:12,782 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-03-04 16:40:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:12,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:12,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:12,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:12,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:12,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:12,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:12,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:12,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:12,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:12,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:12,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:12,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:12,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:12,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:13,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,002 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:13,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:13,040 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,045 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:13,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:13,062 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,072 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,083 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,093 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,110 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,127 INFO L309 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-03-04 16:40:13,127 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:13,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:13,166 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,186 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:13,187 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:13,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,223 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:13,223 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,243 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:13,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:13,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,282 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:13,282 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,302 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:13,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:13,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:13,341 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:13,342 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:13,362 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:13,362 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:13,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:13,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:13,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:13,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:13,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:13,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:13,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:13,497 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-03-04 16:40:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:14,480 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-03-04 16:40:14,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:40:14,481 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:14,483 INFO L225 Difference]: With dead ends: 204 [2019-03-04 16:40:14,483 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:40:14,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:40:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-03-04 16:40:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-03-04 16:40:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-03-04 16:40:14,583 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-03-04 16:40:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:14,583 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-03-04 16:40:14,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-03-04 16:40:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:14,584 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:14,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:14,584 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-03-04 16:40:14,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:14,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:14,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:14,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:14,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:14,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:14,704 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-03-04 16:40:14,705 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:14,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:14,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:14,707 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:14,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:14,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:14,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:14,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:14,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:14,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:14,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:14,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:14,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:14,744 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:14,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:14,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,781 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:14,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:14,803 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,813 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,824 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,834 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,844 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,861 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,862 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:14,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,903 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:14,903 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,918 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,919 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:14,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,944 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:14,944 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:14,959 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:14,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:40:14,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:14,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:40:14,987 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:15,001 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:15,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:40:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:15,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:15,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:15,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:15,193 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-03-04 16:40:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:15,793 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-03-04 16:40:15,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:15,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:15,795 INFO L225 Difference]: With dead ends: 178 [2019-03-04 16:40:15,796 INFO L226 Difference]: Without dead ends: 177 [2019-03-04 16:40:15,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-03-04 16:40:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-03-04 16:40:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:40:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-03-04 16:40:15,889 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-03-04 16:40:15,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:15,889 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-03-04 16:40:15,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-03-04 16:40:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:15,889 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:15,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:15,890 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:15,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-03-04 16:40:15,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:15,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:15,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:15,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:15,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:15,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:15,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:15,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:15,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:15,966 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-03-04 16:40:15,968 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:15,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:15,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:15,971 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:15,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:15,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:15,972 INFO 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-03-04 16:40:15,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:15,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:15,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:40:15,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:15,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:16,007 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:16,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:16,035 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,053 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:40:16,056 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,081 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:40:16,081 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,090 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,101 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,111 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,121 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,136 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:16,136 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-03-04 16:40:16,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,166 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:16,166 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,176 INFO L309 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-03-04 16:40:16,177 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:40:16,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,195 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:40:16,195 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,205 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:16,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:40:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:16,221 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:16,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:16,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:16,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:16,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:16,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:16,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:16,258 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-03-04 16:40:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:16,616 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-03-04 16:40:16,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:16,616 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:40:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:16,618 INFO L225 Difference]: With dead ends: 134 [2019-03-04 16:40:16,618 INFO L226 Difference]: Without dead ends: 133 [2019-03-04 16:40:16,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-03-04 16:40:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-03-04 16:40:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-03-04 16:40:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-03-04 16:40:16,724 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-03-04 16:40:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:16,724 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-03-04 16:40:16,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-03-04 16:40:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:16,724 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:16,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:16,725 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-03-04 16:40:16,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:16,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:16,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:16,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:16,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:16,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:16,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:16,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:16,855 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-03-04 16:40:16,856 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:16,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:16,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:16,858 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:16,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:16,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:16,859 INFO 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-03-04 16:40:16,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:16,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:16,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:16,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:16,878 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:16,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,885 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:16,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,897 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:16,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,904 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,907 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,912 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:16,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,923 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:16,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:16,930 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,940 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,951 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,961 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,972 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:16,991 INFO L309 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-03-04 16:40:16,991 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:17,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:17,026 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,045 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:17,045 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:17,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,105 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,107 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:17,107 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,126 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:17,127 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:17,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:17,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:17,160 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:17,180 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:17,180 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:17,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:17,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:17,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:17,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:17,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:17,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:17,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:17,263 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-03-04 16:40:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:17,885 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-03-04 16:40:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:17,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:17,887 INFO L225 Difference]: With dead ends: 143 [2019-03-04 16:40:17,887 INFO L226 Difference]: Without dead ends: 142 [2019-03-04 16:40:17,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-03-04 16:40:17,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-03-04 16:40:17,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-03-04 16:40:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-03-04 16:40:17,986 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-03-04 16:40:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:17,986 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-03-04 16:40:17,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-03-04 16:40:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:17,986 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:17,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:17,987 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-03-04 16:40:17,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:17,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:17,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:17,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:18,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:18,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:18,067 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-03-04 16:40:18,068 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:18,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:18,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:18,071 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:18,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:18,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:18,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:18,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:18,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:18,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:40:18,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:18,095 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:18,106 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:18,131 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:18,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,151 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:40:18,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,181 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:40:18,182 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,191 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,201 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,211 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,221 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,235 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:18,235 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:40:18,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:18,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,276 INFO L309 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-03-04 16:40:18,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:40:18,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:18,297 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,314 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:18,314 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:40:18,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:18,331 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:40:18,332 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:18,342 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:18,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:40:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,357 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:18,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:18,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:18,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:18,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:18,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:18,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:18,401 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-03-04 16:40:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:18,877 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-03-04 16:40:18,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:18,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:18,879 INFO L225 Difference]: With dead ends: 151 [2019-03-04 16:40:18,880 INFO L226 Difference]: Without dead ends: 150 [2019-03-04 16:40:18,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:40:18,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-03-04 16:40:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-03-04 16:40:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-03-04 16:40:18,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-03-04 16:40:18,985 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-03-04 16:40:18,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:18,985 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-03-04 16:40:18,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-03-04 16:40:18,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:18,985 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:18,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:18,986 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-03-04 16:40:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:18,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:18,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:19,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:19,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:19,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:19,140 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-03-04 16:40:19,141 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:19,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:19,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:19,146 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:40:19,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:19,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:19,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:19,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:19,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:19,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:19,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:19,165 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:19,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,172 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:19,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,185 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:19,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:19,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:19,217 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,228 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,240 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,250 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,261 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,278 INFO L309 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-03-04 16:40:19,279 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:19,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,427 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:19,428 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,447 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,447 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:19,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,481 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:19,482 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,501 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,502 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:19,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:19,540 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,560 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,560 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:19,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:19,596 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:19,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:19,616 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:19,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:19,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:19,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:19,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:40:19,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:19,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:19,710 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-03-04 16:40:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:20,614 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-03-04 16:40:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:20,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:20,617 INFO L225 Difference]: With dead ends: 215 [2019-03-04 16:40:20,618 INFO L226 Difference]: Without dead ends: 214 [2019-03-04 16:40:20,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-03-04 16:40:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-03-04 16:40:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-03-04 16:40:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-03-04 16:40:20,744 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-03-04 16:40:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:20,745 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-03-04 16:40:20,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-03-04 16:40:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:20,745 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:20,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:20,746 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:20,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-03-04 16:40:20,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:20,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:20,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:20,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:20,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:20,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:20,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:20,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:20,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:20,771 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-03-04 16:40:20,772 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:20,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:20,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:20,775 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-03-04 16:40:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:20,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:20,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:20,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 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-03-04 16:40:20,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:20,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:20,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-03-04 16:40:20,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:20,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:20,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:20,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:20,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:40:21,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 27 treesize of output 38 [2019-03-04 16:40:21,309 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,317 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,326 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,336 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,346 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,356 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:21,356 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-03-04 16:40:21,362 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-03-04 16:40:21,363 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,364 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:21,364 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-03-04 16:40:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:21,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:40:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:40:21,426 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:21,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:40:21,427 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-03-04 16:40:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:21,765 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-03-04 16:40:21,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:40:21,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-03-04 16:40:21,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:21,769 INFO L225 Difference]: With dead ends: 280 [2019-03-04 16:40:21,770 INFO L226 Difference]: Without dead ends: 275 [2019-03-04 16:40:21,770 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-03-04 16:40:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-03-04 16:40:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-03-04 16:40:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-03-04 16:40:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-03-04 16:40:22,019 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-03-04 16:40:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:22,020 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-03-04 16:40:22,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-03-04 16:40:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:22,020 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:22,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:22,021 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-03-04 16:40:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:22,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:22,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:22,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:22,681 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:40:22,854 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-03-04 16:40:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:22,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:22,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:22,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:22,900 INFO 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-03-04 16:40:22,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:22,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:22,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:22,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:22,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:22,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:22,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:22,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,925 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:22,928 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,931 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:22,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,941 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:22,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,955 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:22,956 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:22,956 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,966 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,976 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,987 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:22,997 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,014 INFO L309 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-03-04 16:40:23,015 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:23,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:23,052 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,069 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,069 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:23,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:23,103 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,122 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,122 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:23,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:23,157 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,176 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,176 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:23,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:23,211 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:23,212 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:23,235 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:23,236 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:23,259 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:23,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:23,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:40:23,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:23,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:40:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:40:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:23,330 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-03-04 16:40:24,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:24,363 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-03-04 16:40:24,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:24,364 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-03-04 16:40:24,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:24,368 INFO L225 Difference]: With dead ends: 329 [2019-03-04 16:40:24,368 INFO L226 Difference]: Without dead ends: 328 [2019-03-04 16:40:24,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-03-04 16:40:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-03-04 16:40:24,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-03-04 16:40:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-03-04 16:40:24,643 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-03-04 16:40:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:24,644 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-03-04 16:40:24,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:40:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-03-04 16:40:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:24,645 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:24,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:24,645 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-03-04 16:40:24,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:24,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:24,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:24,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:24,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:24,728 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-03-04 16:40:24,729 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:24,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:24,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:24,731 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:24,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:24,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:24,732 INFO 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-03-04 16:40:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:24,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:40:24,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:24,761 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:24,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:24,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,794 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:24,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:24,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,829 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:24,830 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,840 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,850 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,860 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,870 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,886 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,887 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:24,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,917 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:24,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,937 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,937 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:40:24,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,959 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:24,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:24,962 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:24,977 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:24,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:24,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:25,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:25,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:40:25,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:25,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:25,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:25,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:25,039 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-03-04 16:40:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:25,613 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-03-04 16:40:25,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:25,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:40:25,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:25,616 INFO L225 Difference]: With dead ends: 290 [2019-03-04 16:40:25,616 INFO L226 Difference]: Without dead ends: 286 [2019-03-04 16:40:25,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-03-04 16:40:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-03-04 16:40:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 16:40:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-03-04 16:40:25,878 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-03-04 16:40:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-03-04 16:40:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-03-04 16:40:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:25,880 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:25,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:25,880 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:25,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-03-04 16:40:25,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:25,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:25,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:25,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:25,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:25,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:25,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:25,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:25,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:25,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:40:25,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:25,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:25,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:25,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:25,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:40:25,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:26,001 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:26,013 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:26,038 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:26,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,067 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:40:26,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,103 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:40:26,104 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,114 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,124 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,134 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,144 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,159 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:26,159 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:40:26,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:26,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,201 INFO L309 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-03-04 16:40:26,202 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:40:26,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,221 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:26,222 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,231 INFO L309 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-03-04 16:40:26,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:40:26,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:26,253 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:26,254 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:26,264 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:26,264 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-03-04 16:40:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:26,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:26,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:26,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:26,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:26,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:26,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:26,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:26,333 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-03-04 16:40:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:26,957 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-03-04 16:40:26,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:26,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:26,960 INFO L225 Difference]: With dead ends: 307 [2019-03-04 16:40:26,960 INFO L226 Difference]: Without dead ends: 302 [2019-03-04 16:40:26,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:26,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-03-04 16:40:27,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-03-04 16:40:27,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-03-04 16:40:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-03-04 16:40:27,216 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-03-04 16:40:27,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:27,216 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-03-04 16:40:27,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:27,217 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-03-04 16:40:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:27,217 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:27,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:27,217 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-03-04 16:40:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:27,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:27,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:27,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:27,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:27,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:27,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:27,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:27,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:27,451 INFO 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-03-04 16:40:27,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:27,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:27,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:27,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:27,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:27,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:27,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:27,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,473 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:27,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,478 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:27,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,489 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:27,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,502 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:27,504 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,515 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,524 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,534 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,545 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,561 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,562 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:27,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,603 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:27,604 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,624 INFO L309 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-03-04 16:40:27,624 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:27,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:27,665 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,685 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:27,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,726 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:27,726 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,745 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,746 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:27,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,785 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:27,785 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,805 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,805 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:27,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:27,843 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:27,844 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:27,864 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:27,864 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:27,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:28,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:28,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:40:28,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:28,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:40:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:40:28,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:28,006 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-03-04 16:40:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:29,418 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-03-04 16:40:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:29,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-03-04 16:40:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:29,422 INFO L225 Difference]: With dead ends: 284 [2019-03-04 16:40:29,422 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:40:29,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:40:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:40:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-03-04 16:40:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-03-04 16:40:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-03-04 16:40:29,666 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-03-04 16:40:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:29,666 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-03-04 16:40:29,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:40:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-03-04 16:40:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:29,667 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:29,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:29,667 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-03-04 16:40:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:29,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:29,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:29,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:29,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:29,731 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-03-04 16:40:29,731 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:29,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:29,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:29,734 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:29,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:29,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:29,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:29,735 INFO 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-03-04 16:40:29,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:29,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:29,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:29,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:29,756 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:29,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,764 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:29,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:29,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,782 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:29,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,798 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:29,798 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,808 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,818 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,829 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,840 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,859 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,860 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:29,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,896 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:29,896 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,916 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,916 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:29,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,946 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:29,947 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:29,948 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:29,967 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:29,968 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:29,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:40:30,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:30,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:40:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:40:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:30,018 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-03-04 16:40:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:30,535 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-03-04 16:40:30,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:40:30,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-03-04 16:40:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:30,537 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:40:30,537 INFO L226 Difference]: Without dead ends: 223 [2019-03-04 16:40:30,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:40:30,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-03-04 16:40:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-03-04 16:40:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-03-04 16:40:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-03-04 16:40:30,803 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-03-04 16:40:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:30,803 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-03-04 16:40:30,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:40:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-03-04 16:40:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:30,804 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:30,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:30,804 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:30,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-03-04 16:40:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:30,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:30,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:30,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:30,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:30,918 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-03-04 16:40:30,919 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:30,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:30,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:30,924 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:30,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:30,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:30,924 INFO 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-03-04 16:40:30,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:30,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:30,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:30,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:30,945 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:30,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:30,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,963 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:30,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:30,975 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,977 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:30,987 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:30,987 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:30,998 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,008 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,019 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,029 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,048 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,049 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:31,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,077 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,079 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,081 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,082 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:31,082 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,102 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,102 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:31,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,136 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:31,136 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,156 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,157 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:31,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:31,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:31,192 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:31,212 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:31,213 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:31,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:31,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-03-04 16:40:31,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:31,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:40:31,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:40:31,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:31,273 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-03-04 16:40:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:32,004 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-03-04 16:40:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:32,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-03-04 16:40:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:32,008 INFO L225 Difference]: With dead ends: 254 [2019-03-04 16:40:32,008 INFO L226 Difference]: Without dead ends: 253 [2019-03-04 16:40:32,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:32,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-03-04 16:40:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-03-04 16:40:32,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-03-04 16:40:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-03-04 16:40:32,298 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-03-04 16:40:32,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:32,298 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-03-04 16:40:32,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:40:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-03-04 16:40:32,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:32,299 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:32,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:32,299 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-03-04 16:40:32,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:32,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:32,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:32,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:32,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:32,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:32,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:32,370 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-03-04 16:40:32,371 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:32,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:32,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:32,374 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:32,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:32,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:32,374 INFO 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-03-04 16:40:32,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:32,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:32,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:32,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:32,395 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:32,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:32,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,409 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:32,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,425 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:32,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,442 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,451 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:32,451 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,464 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,475 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,492 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,502 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,520 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:32,520 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:32,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:32,550 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,567 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:32,567 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:32,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:32,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:32,597 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:32,617 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:32,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:32,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:32,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:32,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:40:32,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:32,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:40:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:40:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:32,676 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-03-04 16:40:33,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:33,153 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-03-04 16:40:33,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:33,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:40:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:33,155 INFO L225 Difference]: With dead ends: 223 [2019-03-04 16:40:33,155 INFO L226 Difference]: Without dead ends: 216 [2019-03-04 16:40:33,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-03-04 16:40:33,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-03-04 16:40:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-03-04 16:40:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-03-04 16:40:33,443 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-03-04 16:40:33,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:33,443 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-03-04 16:40:33,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:40:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-03-04 16:40:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:33,444 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:33,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:33,444 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:33,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:33,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-03-04 16:40:33,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:33,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:33,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:33,612 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:40:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:33,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:33,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:33,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:33,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:33,731 INFO 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-03-04 16:40:33,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:33,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:33,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:33,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:33,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:40:33,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:33,748 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:33,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,756 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:33,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,765 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:33,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:33,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,790 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:33,791 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,801 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,811 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,822 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,832 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,852 INFO L309 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-03-04 16:40:33,852 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:33,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,887 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:33,888 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:33,908 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:33,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,943 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:33,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:33,946 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:33,966 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:33,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:34,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,010 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,011 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,013 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,016 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:34,019 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,038 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,039 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:34,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,075 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,076 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:34,077 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:34,077 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:34,096 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:34,096 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:34,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:34,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:40:34,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:34,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:40:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:40:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:40:34,215 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-03-04 16:40:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:35,354 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-03-04 16:40:35,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:40:35,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-03-04 16:40:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:35,358 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:40:35,359 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:40:35,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:40:35,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:40:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-03-04 16:40:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-03-04 16:40:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-03-04 16:40:35,623 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-03-04 16:40:35,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:35,623 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-03-04 16:40:35,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:40:35,623 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-03-04 16:40:35,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:35,624 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:35,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:35,624 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:35,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:35,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-03-04 16:40:35,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:35,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:35,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:35,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:35,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:35,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:35,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:35,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:35,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:35,769 INFO 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-03-04 16:40:35,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:35,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:35,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:35,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:35,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:35,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:35,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:35,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:35,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,815 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:35,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,831 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:35,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,844 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,859 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:35,859 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,872 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,888 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,900 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,916 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:35,946 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:35,946 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:35,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:35,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,006 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:36,007 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,026 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,027 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:36,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,053 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,054 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,055 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,057 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,059 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,061 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,063 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:36,063 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,083 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,083 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:40:36,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:36,374 INFO L301 Elim1Store]: Index analysis took 233 ms [2019-03-04 16:40:36,374 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:36,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:36,396 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:36,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,419 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:36,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:36,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:36,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:36,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:36,475 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-03-04 16:40:37,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:37,288 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-03-04 16:40:37,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:37,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:37,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:37,293 INFO L225 Difference]: With dead ends: 252 [2019-03-04 16:40:37,293 INFO L226 Difference]: Without dead ends: 247 [2019-03-04 16:40:37,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-03-04 16:40:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-03-04 16:40:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:40:37,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-03-04 16:40:37,546 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-03-04 16:40:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:37,547 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-03-04 16:40:37,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-03-04 16:40:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:37,547 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:37,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:37,548 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-03-04 16:40:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:37,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:37,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:37,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:37,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:37,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:37,632 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-03-04 16:40:37,633 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:37,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:37,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:37,636 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:37,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:37,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:37,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:37,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:37,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:37,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:37,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:37,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:37,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:37,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,678 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:37,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,691 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:37,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:37,707 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,717 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,728 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,738 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,749 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,768 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,769 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:37,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:37,802 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,822 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,822 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:37,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:37,871 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:37,871 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:37,891 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:37,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,914 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:37,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:37,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:37,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:40:37,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:37,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:40:37,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:40:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:37,957 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-03-04 16:40:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:38,445 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-03-04 16:40:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:38,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:40:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:38,448 INFO L225 Difference]: With dead ends: 194 [2019-03-04 16:40:38,448 INFO L226 Difference]: Without dead ends: 193 [2019-03-04 16:40:38,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-03-04 16:40:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-03-04 16:40:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-03-04 16:40:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-03-04 16:40:38,697 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-03-04 16:40:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:38,697 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-03-04 16:40:38,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:40:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-03-04 16:40:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:38,698 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:38,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:38,698 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-03-04 16:40:38,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:38,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:38,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:39,145 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-03-04 16:40:39,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:39,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:39,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:39,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:39,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:39,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:39,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:39,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:39,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:40:39,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:39,297 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:39,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:39,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,323 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:39,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:39,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:39,358 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,368 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,379 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,389 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,400 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,416 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:39,417 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:39,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:39,460 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,475 INFO L309 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-03-04 16:40:39,475 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:40:39,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:39,518 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,532 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:39,533 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:39,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:39,557 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:40:39,557 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:39,571 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:39,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:40:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:39,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:39,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:39,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:39,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:39,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:39,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:39,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:39,647 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-03-04 16:40:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:40,480 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-03-04 16:40:40,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:40,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-03-04 16:40:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:40,483 INFO L225 Difference]: With dead ends: 265 [2019-03-04 16:40:40,483 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 16:40:40,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 16:40:40,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-03-04 16:40:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:40:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-03-04 16:40:40,827 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-03-04 16:40:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:40,827 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-03-04 16:40:40,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:40,827 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-03-04 16:40:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:40,828 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:40,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:40,828 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:40,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-03-04 16:40:40,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:40,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:40,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:40,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:40,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:40,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:40,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:40,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:40,904 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-03-04 16:40:40,904 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:40,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:40,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:40,907 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:40,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:40,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:40,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:40,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:40,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:40,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:40,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:40:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:40,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:40,944 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:40,972 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:40,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:40,998 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:40:41,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,023 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:40:41,023 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,031 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,041 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,052 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,062 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,076 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:41,077 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:40:41,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:41,109 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,118 INFO L309 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-03-04 16:40:41,118 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-03-04 16:40:41,135 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,137 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:41,138 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:41,138 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:41,149 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:41,150 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-03-04 16:40:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:41,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:41,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:40:41,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:40:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:40:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:41,206 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-03-04 16:40:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:41,688 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-03-04 16:40:41,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:41,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:40:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:41,690 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:40:41,690 INFO L226 Difference]: Without dead ends: 203 [2019-03-04 16:40:41,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-03-04 16:40:42,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-03-04 16:40:42,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-03-04 16:40:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-03-04 16:40:42,018 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-03-04 16:40:42,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:42,018 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-03-04 16:40:42,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:40:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-03-04 16:40:42,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-03-04 16:40:42,019 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:42,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:42,019 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:42,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:42,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-03-04 16:40:42,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:42,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:42,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:42,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:42,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:42,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:42,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-03-04 16:40:42,097 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-03-04 16:40:42,097 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:42,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:42,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:42,099 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:40:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:42,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:42,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:42,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:42,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:42,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:40:42,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:42,123 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:42,142 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:42,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,159 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:40:42,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,175 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:40:42,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,192 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:40:42,193 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,202 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,212 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,222 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,233 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,249 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,249 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:40:42,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,283 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,288 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:42,289 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,302 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:40:42,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:42,326 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:40:42,327 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:42,341 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:42,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:40:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:42,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:42,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:40:42,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:42,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:40:42,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:40:42,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:40:42,403 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-03-04 16:40:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:42,956 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-03-04 16:40:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:40:42,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-03-04 16:40:42,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:42,958 INFO L225 Difference]: With dead ends: 216 [2019-03-04 16:40:42,958 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:40:42,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:40:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:40:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-03-04 16:40:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-03-04 16:40:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-03-04 16:40:43,314 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-03-04 16:40:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:43,315 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-03-04 16:40:43,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:40:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-03-04 16:40:43,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:43,315 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:43,315 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:43,316 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:43,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-03-04 16:40:43,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:43,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:43,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:43,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:43,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:43,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:43,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:43,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:43,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:43,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:43,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:40:43,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:43,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:43,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:43,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:43,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,453 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:43,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,465 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:43,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,485 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:43,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,499 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,501 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,504 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:43,504 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,515 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,526 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,535 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,546 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,564 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,565 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:43,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,594 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:43,595 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,615 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,615 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:43,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,645 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:43,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,665 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,665 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:43,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:43,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:43,699 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:43,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:43,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:43,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:43,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:40:43,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:43,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:43,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:43,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:40:43,784 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-03-04 16:40:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:44,831 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-03-04 16:40:44,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:44,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:40:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:44,833 INFO L225 Difference]: With dead ends: 401 [2019-03-04 16:40:44,834 INFO L226 Difference]: Without dead ends: 397 [2019-03-04 16:40:44,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:44,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-03-04 16:40:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-03-04 16:40:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-03-04 16:40:45,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-03-04 16:40:45,434 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-03-04 16:40:45,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:45,434 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-03-04 16:40:45,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-03-04 16:40:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:45,435 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:45,435 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:45,435 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-03-04 16:40:45,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:45,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:45,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:45,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:40:45,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:40:45,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:40:45,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:40:45,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:40:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:40:45,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:40:45,498 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-03-04 16:40:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:46,103 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-03-04 16:40:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:40:46,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-03-04 16:40:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:46,105 INFO L225 Difference]: With dead ends: 347 [2019-03-04 16:40:46,105 INFO L226 Difference]: Without dead ends: 342 [2019-03-04 16:40:46,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:40:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-03-04 16:40:46,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-03-04 16:40:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-03-04 16:40:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-03-04 16:40:46,724 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-03-04 16:40:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:46,724 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-03-04 16:40:46,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:40:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-03-04 16:40:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:46,725 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:46,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:46,725 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-03-04 16:40:46,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:46,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:46,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:46,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:47,050 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2019-03-04 16:40:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:47,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:47,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:47,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:40:47,158 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-03-04 16:40:47,159 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:47,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:47,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:47,162 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:40:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:47,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:47,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:47,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:47,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:47,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:47,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:47,180 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:47,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:47,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,190 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:47,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,196 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,197 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,199 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,200 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:47,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,216 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:47,216 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,227 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,237 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,248 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,259 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,278 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,278 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:47,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,315 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,316 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:47,317 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,338 INFO L309 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-03-04 16:40:47,339 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:47,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:47,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,395 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,396 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:47,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,432 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,434 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:47,435 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,454 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,455 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:47,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,484 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,485 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,486 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,488 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,490 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:47,492 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,512 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,512 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:47,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:47,553 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:47,553 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:47,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:47,584 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:47,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:47,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:47,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-03-04 16:40:47,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:47,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:40:47,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:40:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:40:47,689 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-03-04 16:40:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:49,378 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-03-04 16:40:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:49,379 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:40:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:49,382 INFO L225 Difference]: With dead ends: 471 [2019-03-04 16:40:49,382 INFO L226 Difference]: Without dead ends: 470 [2019-03-04 16:40:49,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:40:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-03-04 16:40:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-03-04 16:40:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-03-04 16:40:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-03-04 16:40:50,022 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-03-04 16:40:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:50,022 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-03-04 16:40:50,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:40:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-03-04 16:40:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:50,023 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:50,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:50,023 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:50,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-03-04 16:40:50,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:50,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:50,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:50,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:50,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:50,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:50,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:50,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:50,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:50,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:50,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:40:50,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:40:50,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:40:50,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:50,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:50,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:50,293 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:50,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:50,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,303 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:50,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,313 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:50,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,318 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,327 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:50,328 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,338 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,347 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,357 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,368 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,386 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,386 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:50,411 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,415 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,422 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:50,423 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,441 INFO L309 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-03-04 16:40:50,442 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:50,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,470 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,471 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:50,480 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,498 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:50,499 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:50,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,538 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,540 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:50,541 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,559 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:50,559 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:50,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:50,596 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,615 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:50,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:50,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:50,657 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:50,658 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:50,677 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:50,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:50,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:50,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:40:50,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:50,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:40:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:40:50,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:40:50,801 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-03-04 16:40:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:52,609 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-03-04 16:40:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:40:52,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-03-04 16:40:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:52,612 INFO L225 Difference]: With dead ends: 483 [2019-03-04 16:40:52,612 INFO L226 Difference]: Without dead ends: 482 [2019-03-04 16:40:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:40:52,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-03-04 16:40:53,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-03-04 16:40:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-03-04 16:40:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-03-04 16:40:53,282 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-03-04 16:40:53,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:53,282 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-03-04 16:40:53,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:40:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-03-04 16:40:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:53,284 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:53,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:53,284 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-03-04 16:40:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:53,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:40:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:53,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:53,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:53,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:53,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:40:53,401 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:40:53,402 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:53,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:53,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:53,404 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:53,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:53,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:53,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:53,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:53,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:53,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:40:53,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:53,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:53,439 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:40:53,456 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:40:53,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,475 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:40:53,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:40:53,500 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,508 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,518 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,528 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,538 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,553 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:53,553 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:40:53,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,586 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:40:53,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,596 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,597 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:24 [2019-03-04 16:40:53,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:40:53,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,626 INFO L309 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-03-04 16:40:53,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-03-04 16:40:53,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:53,647 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:40:53,648 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:53,658 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:53,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:40:53,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:53,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:53,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:53,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:53,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:53,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:53,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:53,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:53,729 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-03-04 16:40:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:54,709 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-03-04 16:40:54,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:54,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:40:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:54,711 INFO L225 Difference]: With dead ends: 400 [2019-03-04 16:40:54,711 INFO L226 Difference]: Without dead ends: 393 [2019-03-04 16:40:54,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-03-04 16:40:55,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-03-04 16:40:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-03-04 16:40:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-03-04 16:40:55,374 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-03-04 16:40:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:55,374 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-03-04 16:40:55,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-03-04 16:40:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:55,375 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:55,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:55,376 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:55,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:55,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-03-04 16:40:55,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:55,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:55,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:40:55,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:55,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:55,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:40:55,495 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-03-04 16:40:55,496 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:40:55,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:40:55,499 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:40:55,500 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:40:55,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:55,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:40:55,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:55,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:55,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:55,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:40:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:55,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:40:55,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:55,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:55,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,533 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:55,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,540 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:55,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:55,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:55,576 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,586 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,596 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,606 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,616 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,635 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:55,636 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:55,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:55,669 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,688 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:55,688 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:55,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:55,721 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,740 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:55,741 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:55,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:55,772 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:55,773 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:55,792 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:55,792 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:55,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:55,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:55,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:40:55,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:55,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:40:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:40:55,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:40:55,878 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-03-04 16:40:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:40:56,986 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-03-04 16:40:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:40:56,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:40:56,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:40:56,988 INFO L225 Difference]: With dead ends: 409 [2019-03-04 16:40:56,988 INFO L226 Difference]: Without dead ends: 397 [2019-03-04 16:40:56,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:40:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-03-04 16:40:57,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-03-04 16:40:57,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-03-04 16:40:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-03-04 16:40:57,637 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-03-04 16:40:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:40:57,637 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-03-04 16:40:57,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:40:57,637 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-03-04 16:40:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:40:57,638 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:40:57,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:40:57,638 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:40:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:40:57,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-03-04 16:40:57,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:40:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:57,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:40:57,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:40:57,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:40:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:40:57,815 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-03-04 16:40:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:57,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:57,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:40:57,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:40:57,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:40:57,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:40:57,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:40:57,979 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:40:57,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:40:57,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:40:57,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:40:57,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:40:57,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:40:57,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:40:57,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,993 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:40:57,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:57,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,000 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:40:58,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,010 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:40:58,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,022 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,026 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,031 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:40:58,031 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,042 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,052 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,062 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,073 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,092 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,092 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:40:58,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,130 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,130 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:40:58,131 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,148 INFO L309 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-03-04 16:40:58,148 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:40:58,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,181 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,183 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,184 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,186 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:58,187 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,206 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:40:58,246 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,247 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,248 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,249 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,257 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:40:58,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,277 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:40:58,301 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,311 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:58,312 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,331 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:58,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,371 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,373 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,374 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:40:58,375 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:40:58,375 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:40:58,396 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:40:58,397 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:40:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:58,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:40:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:40:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:40:58,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:40:58,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:40:58,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:40:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:40:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:40:58,527 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-03-04 16:41:00,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:00,475 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-03-04 16:41:00,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:00,476 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:41:00,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:00,479 INFO L225 Difference]: With dead ends: 542 [2019-03-04 16:41:00,479 INFO L226 Difference]: Without dead ends: 536 [2019-03-04 16:41:00,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:41:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-03-04 16:41:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-03-04 16:41:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-03-04 16:41:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-03-04 16:41:01,333 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-03-04 16:41:01,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:01,334 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-03-04 16:41:01,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:41:01,334 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-03-04 16:41:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:01,334 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:01,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:01,335 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:01,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-03-04 16:41:01,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:01,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:01,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:01,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:01,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:01,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:01,465 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-03-04 16:41:01,466 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:01,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:01,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:01,468 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:01,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:01,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:01,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:01,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:01,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:01,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:01,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:01,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:01,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,492 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:01,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,499 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:01,503 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,504 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,507 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:01,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:01,525 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,535 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,543 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,554 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,564 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,583 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:01,583 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:01,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,616 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:01,616 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,636 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:01,636 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:01,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,668 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:01,669 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,688 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:01,689 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:01,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:01,728 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:01,729 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:01,747 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:01,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:01,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:01,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:01,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:01,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:01,821 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-03-04 16:41:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:03,113 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-03-04 16:41:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:03,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:03,116 INFO L225 Difference]: With dead ends: 469 [2019-03-04 16:41:03,116 INFO L226 Difference]: Without dead ends: 465 [2019-03-04 16:41:03,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:41:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-03-04 16:41:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-03-04 16:41:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-03-04 16:41:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-03-04 16:41:04,027 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-03-04 16:41:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:04,027 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-03-04 16:41:04,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-03-04 16:41:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:04,028 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:04,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:04,028 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:04,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-03-04 16:41:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:04,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:04,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:04,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:04,248 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-03-04 16:41:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:04,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:04,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:04,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:04,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:04,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:04,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:04,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:04,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:04,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:41:04,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:04,445 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:04,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,455 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:04,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,460 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:04,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,469 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,470 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:04,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,483 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,484 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:04,484 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,494 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,504 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,513 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,521 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,540 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,540 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:04,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,576 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:04,576 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,596 INFO L309 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-03-04 16:41:04,596 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:04,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,634 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:04,634 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,652 INFO L309 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-03-04 16:41:04,652 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-03-04 16:41:04,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,687 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,688 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:41:04,689 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,708 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:04,709 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-03-04 16:41:04,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,751 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:41:04,751 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:04,771 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:04,772 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:41:04,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:04,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:41:04,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:05,035 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:05,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:41:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:05,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:05,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:05,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:41:05,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:05,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:41:05,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:41:05,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:05,352 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-03-04 16:41:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:07,156 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-03-04 16:41:07,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:07,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-03-04 16:41:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:07,159 INFO L225 Difference]: With dead ends: 481 [2019-03-04 16:41:07,160 INFO L226 Difference]: Without dead ends: 480 [2019-03-04 16:41:07,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:41:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-03-04 16:41:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-03-04 16:41:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-03-04 16:41:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-03-04 16:41:07,636 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-03-04 16:41:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:07,636 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-03-04 16:41:07,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:41:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-03-04 16:41:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:07,637 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:07,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:07,637 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:07,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:07,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-03-04 16:41:07,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:07,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:07,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:07,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:07,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:07,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:07,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:07,751 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 16:41:07,752 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:07,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:07,754 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:07,754 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:07,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:07,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:07,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:07,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:07,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:07,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:41:07,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:07,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:07,788 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:07,809 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:41:07,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 33 [2019-03-04 16:41:07,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,854 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 32 [2019-03-04 16:41:07,854 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,863 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,873 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,883 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,893 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,907 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:07,907 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-03-04 16:41:07,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,936 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-03-04 16:41:07,936 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,946 INFO L309 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-03-04 16:41:07,946 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2019-03-04 16:41:07,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:07,962 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-03-04 16:41:07,963 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:07,972 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:07,972 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-03-04 16:41:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:07,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:08,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:08,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:41:08,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:08,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:41:08,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:41:08,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:08,028 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-03-04 16:41:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:08,716 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-03-04 16:41:08,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:41:08,717 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-03-04 16:41:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:08,718 INFO L225 Difference]: With dead ends: 267 [2019-03-04 16:41:08,718 INFO L226 Difference]: Without dead ends: 258 [2019-03-04 16:41:08,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-03-04 16:41:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-03-04 16:41:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-03-04 16:41:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-03-04 16:41:09,201 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-03-04 16:41:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:09,201 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-03-04 16:41:09,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:41:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-03-04 16:41:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:09,201 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:09,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:09,202 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-03-04 16:41:09,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:09,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:09,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:09,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:09,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:09,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:09,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:09,397 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:09,397 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-03-04 16:41:09,398 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:09,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:09,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:09,404 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:09,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:09,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:09,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:09,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:09,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:09,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:09,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:09,423 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:09,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,428 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:09,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,433 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,434 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:09,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,443 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:09,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:09,459 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,469 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,478 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,488 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,498 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,517 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,517 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:09,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,552 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:09,552 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,572 INFO L309 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-03-04 16:41:09,572 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:09,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,608 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:09,609 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,628 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:09,629 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:09,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,666 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:09,666 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,686 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:09,686 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:09,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:09,722 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:09,722 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:09,740 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:09,740 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:41:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:09,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:09,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:09,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:41:09,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:09,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:41:09,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:41:09,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:09,860 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-03-04 16:41:11,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:11,130 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-03-04 16:41:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:11,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:41:11,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:11,136 INFO L225 Difference]: With dead ends: 309 [2019-03-04 16:41:11,136 INFO L226 Difference]: Without dead ends: 306 [2019-03-04 16:41:11,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-03-04 16:41:11,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-03-04 16:41:11,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-03-04 16:41:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-03-04 16:41:11,772 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-03-04 16:41:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:11,772 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-03-04 16:41:11,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:41:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-03-04 16:41:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:11,773 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:11,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:11,773 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:11,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:11,773 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-03-04 16:41:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:11,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:11,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:11,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:11,883 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 16:41:11,883 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:11,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:11,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:11,886 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:11,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:11,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:11,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:11,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:11,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:11,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2019-03-04 16:41:11,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:11,907 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:11,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:11,938 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 23 treesize of output 31 [2019-03-04 16:41:11,980 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 25 treesize of output 36 [2019-03-04 16:41:11,983 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:12,011 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 27 treesize of output 35 [2019-03-04 16:41:12,012 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,020 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,031 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,041 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,051 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,063 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:12,063 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-03-04 16:41:12,085 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:12,086 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:41:12,086 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,093 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,093 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-03-04 16:41:12,104 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:12,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-03-04 16:41:12,105 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:12,111 INFO L309 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-03-04 16:41:12,111 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:16 [2019-03-04 16:41:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:12,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:12,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:12,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-03-04 16:41:12,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:12,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:41:12,159 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-03-04 16:41:13,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:13,264 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-03-04 16:41:13,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:13,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:13,266 INFO L225 Difference]: With dead ends: 379 [2019-03-04 16:41:13,267 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 16:41:13,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:41:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 16:41:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-03-04 16:41:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-03-04 16:41:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-03-04 16:41:13,979 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-03-04 16:41:13,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:13,979 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-03-04 16:41:13,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:13,979 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-03-04 16:41:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:13,979 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:13,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:13,980 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:13,980 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-03-04 16:41:13,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:13,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:13,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:13,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:14,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:14,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:14,133 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-03-04 16:41:14,134 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:14,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:14,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:14,136 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:14,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:14,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:14,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:14,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:14,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:14,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:14,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:14,156 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:14,171 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:14,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,182 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:14,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,198 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:14,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,218 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:14,218 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,227 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,237 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,248 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,258 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,274 INFO L309 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-03-04 16:41:14,275 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:14,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,313 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:14,314 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,329 INFO L309 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-03-04 16:41:14,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:14,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:14,357 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,372 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:14,373 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:14,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,402 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:14,402 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,418 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:14,418 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:41:14,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,446 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:14,449 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:41:14,449 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:14,464 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:14,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:41:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:14,486 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:14,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:14,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-03-04 16:41:14,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:14,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:14,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:14,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:14,554 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-03-04 16:41:16,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:16,254 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-03-04 16:41:16,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:41:16,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:41:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:16,256 INFO L225 Difference]: With dead ends: 371 [2019-03-04 16:41:16,256 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 16:41:16,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 16:41:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-03-04 16:41:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-03-04 16:41:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-03-04 16:41:17,101 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-03-04 16:41:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:17,101 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-03-04 16:41:17,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-03-04 16:41:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:17,101 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:17,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:17,102 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-03-04 16:41:17,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:17,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:17,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:17,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:17,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:17,237 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-03-04 16:41:17,237 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:17,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:17,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:17,239 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:17,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:17,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:17,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:17,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:17,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:17,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:17,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:17,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:17,259 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:17,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,263 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:17,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:17,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,285 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:17,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:17,366 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:17,366 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,504 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,649 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,789 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:17,945 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,175 INFO L309 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-03-04 16:41:18,176 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:18,447 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-03-04 16:41:18,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:18,671 INFO L301 Elim1Store]: Index analysis took 195 ms [2019-03-04 16:41:18,671 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:18,672 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:18,900 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:18,900 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:19,183 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-03-04 16:41:19,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,431 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,457 INFO L301 Elim1Store]: Index analysis took 247 ms [2019-03-04 16:41:19,457 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:19,458 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,705 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:19,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:19,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:19,743 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,763 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:19,763 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:19,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:19,800 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:19,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:19,820 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:19,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:19,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:41:19,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:19,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:41:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:41:19,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:19,921 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-03-04 16:41:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:21,378 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-03-04 16:41:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:21,378 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:41:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:21,379 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:41:21,379 INFO L226 Difference]: Without dead ends: 284 [2019-03-04 16:41:21,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:21,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-03-04 16:41:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-03-04 16:41:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-03-04 16:41:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-03-04 16:41:22,256 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-03-04 16:41:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:22,256 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-03-04 16:41:22,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:41:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-03-04 16:41:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:22,257 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:22,257 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:22,257 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-03-04 16:41:22,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:22,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:22,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:22,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:22,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:22,529 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-03-04 16:41:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:22,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:22,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:22,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:22,579 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-03-04 16:41:22,580 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:22,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:22,582 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:22,582 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:22,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:22,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:22,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:22,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:22,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:22,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:22,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:22,602 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:22,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,606 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:22,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,610 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,612 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:22,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,621 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:22,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,635 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:22,635 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,645 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,654 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,663 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,673 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,691 INFO L309 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-03-04 16:41:22,691 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:22,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,723 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:22,723 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,741 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:22,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:22,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,794 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:22,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,828 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:22,830 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:22,830 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:22,849 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:22,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:22,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:22,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:22,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:22,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:22,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:22,931 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-03-04 16:41:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:24,293 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-03-04 16:41:24,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:24,294 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:24,295 INFO L225 Difference]: With dead ends: 281 [2019-03-04 16:41:24,295 INFO L226 Difference]: Without dead ends: 274 [2019-03-04 16:41:24,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-03-04 16:41:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-03-04 16:41:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-03-04 16:41:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-03-04 16:41:25,293 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-03-04 16:41:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:25,293 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-03-04 16:41:25,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-03-04 16:41:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:25,294 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:25,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:25,294 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-03-04 16:41:25,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:25,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:25,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:25,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:25,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:25,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:25,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:25,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:25,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:25,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:25,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:25,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:25,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:25,509 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:25,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:25,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,526 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:25,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,539 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,539 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:25,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,547 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,552 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,553 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,555 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:25,555 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,566 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,576 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,587 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,598 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,617 INFO L309 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-03-04 16:41:25,618 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:25,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,652 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:25,652 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,672 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:25,672 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:25,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,712 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:25,713 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,733 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:25,734 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:25,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,776 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:25,776 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,853 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:25,854 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:25,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,887 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:25,892 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:25,892 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:25,912 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:25,912 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:25,938 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:26,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:26,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:26,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:26,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:26,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:26,023 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-03-04 16:41:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:27,727 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-03-04 16:41:27,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:27,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:41:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:27,728 INFO L225 Difference]: With dead ends: 295 [2019-03-04 16:41:27,729 INFO L226 Difference]: Without dead ends: 288 [2019-03-04 16:41:27,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:41:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-03-04 16:41:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-03-04 16:41:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-03-04 16:41:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-03-04 16:41:28,722 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-03-04 16:41:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:28,722 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-03-04 16:41:28,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:28,723 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-03-04 16:41:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:28,723 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:28,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:28,723 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-03-04 16:41:28,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:28,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:28,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:28,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:28,879 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:28,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:28,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:28,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:28,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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:28,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:28,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:28,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:28,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:28,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:28,908 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:28,922 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:28,926 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,935 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:28,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,952 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:28,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,960 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:28,973 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:28,973 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,982 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:28,992 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,003 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,013 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,028 INFO L309 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-03-04 16:41:29,028 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:29,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,071 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:29,075 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,090 INFO L309 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-03-04 16:41:29,090 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:29,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,120 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:29,120 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,135 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:29,135 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:29,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:29,165 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:29,178 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:41:29,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,209 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:29,210 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:29,210 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:29,225 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:29,225 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:41:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:29,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:29,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:29,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:29,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:29,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:29,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:29,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:29,318 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-03-04 16:41:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:31,331 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-03-04 16:41:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:31,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:41:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:31,333 INFO L225 Difference]: With dead ends: 370 [2019-03-04 16:41:31,333 INFO L226 Difference]: Without dead ends: 363 [2019-03-04 16:41:31,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-03-04 16:41:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-03-04 16:41:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-03-04 16:41:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-03-04 16:41:32,448 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-03-04 16:41:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:32,448 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-03-04 16:41:32,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-03-04 16:41:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:32,449 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:32,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:32,449 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-03-04 16:41:32,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:32,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:32,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:32,877 WARN L181 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 20 [2019-03-04 16:41:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:32,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:32,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:32,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:32,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:32,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:32,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:41:32,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:41:32,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:41:32,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:32,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:32,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:32,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:32,995 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:32,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:33,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,014 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,025 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:33,028 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,029 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,030 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,031 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,032 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,033 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,044 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:33,044 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,055 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,065 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,075 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,086 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,102 INFO L309 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-03-04 16:41:33,103 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:33,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,146 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:33,146 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,161 INFO L309 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-03-04 16:41:33,161 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:33,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,191 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:33,191 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,206 INFO L309 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-03-04 16:41:33,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:33,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,238 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:33,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,253 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:33,254 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:33,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:33,280 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:33,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:33,296 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:33,296 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:41:33,315 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:33,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:33,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:33,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:33,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:33,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:33,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:33,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:33,395 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-03-04 16:41:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:35,192 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-03-04 16:41:35,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:35,192 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:41:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:35,193 INFO L225 Difference]: With dead ends: 349 [2019-03-04 16:41:35,193 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 16:41:35,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:41:35,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 16:41:36,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-03-04 16:41:36,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-03-04 16:41:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-03-04 16:41:36,157 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-03-04 16:41:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:36,157 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-03-04 16:41:36,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-03-04 16:41:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:36,158 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:36,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:36,158 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-03-04 16:41:36,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:36,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,355 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-03-04 16:41:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:36,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:36,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:36,407 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 16:41:36,408 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:36,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:36,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:36,417 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:36,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:36,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:36,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:36,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:36,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:41:36,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:36,437 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:36,446 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:36,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,456 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:36,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,471 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:36,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,490 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:36,490 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,498 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,507 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,517 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,526 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,542 INFO L309 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-03-04 16:41:36,542 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:36,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:36,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,596 INFO L309 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-03-04 16:41:36,596 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:36,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,623 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:36,623 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,637 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:36,637 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:41:36,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:36,662 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:36,662 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:36,676 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:36,676 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:36,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:36,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:36,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:36,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:36,749 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-03-04 16:41:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:38,148 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-03-04 16:41:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:38,149 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:38,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:38,150 INFO L225 Difference]: With dead ends: 257 [2019-03-04 16:41:38,150 INFO L226 Difference]: Without dead ends: 250 [2019-03-04 16:41:38,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-03-04 16:41:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-03-04 16:41:39,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-03-04 16:41:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-03-04 16:41:39,133 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-03-04 16:41:39,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:39,134 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-03-04 16:41:39,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-03-04 16:41:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:39,134 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:39,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:39,134 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,135 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-03-04 16:41:39,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:39,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:39,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:39,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:39,292 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-03-04 16:41:39,292 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:39,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:39,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:39,294 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:41:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:39,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:39,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:39,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:39,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:39,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:39,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:39,338 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:39,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,340 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:39,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,350 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:39,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,357 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:39,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,369 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,371 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:39,371 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,381 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,390 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,400 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,409 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,427 INFO L309 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-03-04 16:41:39,427 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:39,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,462 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:39,463 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,481 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:39,481 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:39,506 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,512 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,513 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,517 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:39,517 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,535 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:39,536 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:39,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,565 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,566 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,568 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,570 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:39,571 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,588 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:39,588 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:41:39,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,669 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,670 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:39,676 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:41:39,676 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:39,694 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:39,695 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:41:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:39,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:41:39,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:39,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:41:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:41:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:39,782 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-03-04 16:41:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:41,648 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-03-04 16:41:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:41,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-03-04 16:41:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:41,650 INFO L225 Difference]: With dead ends: 316 [2019-03-04 16:41:41,650 INFO L226 Difference]: Without dead ends: 315 [2019-03-04 16:41:41,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:41:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-03-04 16:41:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-03-04 16:41:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-03-04 16:41:42,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-03-04 16:41:42,668 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-03-04 16:41:42,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:42,668 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-03-04 16:41:42,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:41:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-03-04 16:41:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:42,668 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:42,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:42,669 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-03-04 16:41:42,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:42,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:42,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:42,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:42,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:42,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:42,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:42,790 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-03-04 16:41:42,791 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:42,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:42,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:42,793 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:42,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:42,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:42,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:42,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:42,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:42,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:42,817 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:42,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,826 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:42,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:42,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,853 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:42,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,865 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,866 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,870 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:42,870 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,880 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,889 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,899 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,908 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,926 INFO L309 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-03-04 16:41:42,926 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:42,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,956 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,957 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,958 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:42,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:42,959 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:42,977 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:42,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:43,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,173 INFO L301 Elim1Store]: Index analysis took 145 ms [2019-03-04 16:41:43,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:43,174 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,194 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:43,195 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:43,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:43,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:43,229 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:43,247 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:43,247 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:43,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:43,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:43,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:43,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:43,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:43,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:43,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:43,327 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-03-04 16:41:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:44,756 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-03-04 16:41:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:44,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:44,757 INFO L225 Difference]: With dead ends: 253 [2019-03-04 16:41:44,757 INFO L226 Difference]: Without dead ends: 246 [2019-03-04 16:41:44,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-03-04 16:41:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-03-04 16:41:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-03-04 16:41:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-03-04 16:41:45,767 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-03-04 16:41:45,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:45,767 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-03-04 16:41:45,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:45,767 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-03-04 16:41:45,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:45,768 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:45,768 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:45,768 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:45,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:45,768 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-03-04 16:41:45,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:45,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:45,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:45,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:41:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:45,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:45,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:41:45,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:41:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:45,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:45,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:41:45,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:41:45,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:41:45,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:41:45,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:41:45,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:45,965 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:45,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,967 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:45,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,981 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:45,984 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,986 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,987 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,990 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:45,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,996 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:45,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,004 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:46,004 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,014 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,023 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,033 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,043 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,060 INFO L309 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-03-04 16:41:46,061 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:46,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:46,096 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,113 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:46,113 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:46,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,154 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:46,154 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,172 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:46,172 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:46,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,202 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,204 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,206 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,208 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,209 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:46,209 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,227 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:46,227 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:46,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,258 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,259 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,260 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,261 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,262 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,263 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,264 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,265 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:46,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:46,266 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:46,284 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:46,285 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:41:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:46,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:46,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:46,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:41:46,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:46,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:41:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:41:46,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:46,398 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-03-04 16:41:48,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:48,462 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-03-04 16:41:48,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:41:48,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-03-04 16:41:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:48,463 INFO L225 Difference]: With dead ends: 332 [2019-03-04 16:41:48,463 INFO L226 Difference]: Without dead ends: 328 [2019-03-04 16:41:48,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:41:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-03-04 16:41:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-03-04 16:41:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:41:49,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-03-04 16:41:49,450 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-03-04 16:41:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:49,450 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-03-04 16:41:49,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:41:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-03-04 16:41:49,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:49,451 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:49,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:49,451 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:49,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-03-04 16:41:49,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:49,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:49,666 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-03-04 16:41:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:41:49,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:49,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:49,708 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-03-04 16:41:49,709 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:49,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:49,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:49,712 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:49,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:49,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:49,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:49,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:49,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:49,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:49,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:41:49,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:49,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:49,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,736 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:49,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,743 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:49,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:49,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,775 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:49,775 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,785 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,794 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,804 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,814 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,831 INFO L309 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-03-04 16:41:49,831 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:49,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,861 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,865 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:49,865 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,883 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,884 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:49,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,918 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,919 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,920 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,921 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,921 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:49,922 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,940 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,940 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-03-04 16:41:49,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,965 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,966 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,968 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:49,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:49,975 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:49,992 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:49,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:50,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:50,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:50,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:41:50,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:50,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:41:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:41:50,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:41:50,074 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-03-04 16:41:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:51,465 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-03-04 16:41:51,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:41:51,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-03-04 16:41:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:51,466 INFO L225 Difference]: With dead ends: 242 [2019-03-04 16:41:51,466 INFO L226 Difference]: Without dead ends: 241 [2019-03-04 16:41:51,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-03-04 16:41:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-03-04 16:41:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-03-04 16:41:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-03-04 16:41:52,497 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-03-04 16:41:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:52,497 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-03-04 16:41:52,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:41:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-03-04 16:41:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:52,498 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:52,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:52,498 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-03-04 16:41:52,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:52,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:52,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:52,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:52,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:52,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:52,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:52,623 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 16:41:52,623 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:52,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:52,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:52,626 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:52,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:52,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:52,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:52,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:52,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:52,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:41:52,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:52,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:52,694 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:52,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,706 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:52,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:52,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,738 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:52,739 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,748 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,758 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,767 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,777 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,792 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:52,792 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:52,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,831 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,834 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:52,834 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,848 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:52,848 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:52,867 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,868 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,869 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,870 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,872 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,873 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:52,873 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:52,897 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:52,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:41:52,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:52,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:53,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:53,018 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:53,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:53,020 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:53,021 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:41:53,021 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:53,034 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:53,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:41:53,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-03-04 16:41:53,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:53,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:53,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:53,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:53,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:53,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:53,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:53,113 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-03-04 16:41:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:54,578 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-03-04 16:41:54,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:54,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:41:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:54,579 INFO L225 Difference]: With dead ends: 254 [2019-03-04 16:41:54,580 INFO L226 Difference]: Without dead ends: 245 [2019-03-04 16:41:54,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:41:54,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-03-04 16:41:55,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-03-04 16:41:55,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:41:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-03-04 16:41:55,598 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-03-04 16:41:55,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:55,598 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-03-04 16:41:55,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-03-04 16:41:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:55,598 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:55,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:55,599 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:55,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:55,599 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-03-04 16:41:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:55,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:55,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:55,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:55,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:55,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:55,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:55,715 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-03-04 16:41:55,716 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:55,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:55,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:55,718 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:41:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:55,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:55,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:55,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:55,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:55,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:41:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:55,749 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:55,760 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:41:55,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,771 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:41:55,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,785 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:41:55,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,803 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:41:55,804 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,813 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,823 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,832 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,841 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,857 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:55,857 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:41:55,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,895 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:41:55,895 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,909 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:55,909 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:41:55,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,936 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:41:55,937 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,949 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:55,950 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:41:55,969 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,970 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,971 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,972 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,973 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:55,974 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:41:55,975 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:55,989 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:55,989 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:41:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:56,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-03-04 16:41:56,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:56,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:41:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:41:56,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:41:56,056 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-03-04 16:41:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:41:57,473 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-03-04 16:41:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:41:57,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-03-04 16:41:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:41:57,475 INFO L225 Difference]: With dead ends: 249 [2019-03-04 16:41:57,475 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:41:57,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:41:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:41:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-03-04 16:41:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:41:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-03-04 16:41:58,525 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-03-04 16:41:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:41:58,525 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-03-04 16:41:58,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:41:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-03-04 16:41:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:41:58,526 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:41:58,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:41:58,526 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:41:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-03-04 16:41:58,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:41:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:41:58,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:41:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:41:58,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:41:58,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:41:58,598 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-03-04 16:41:58,598 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:41:58,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:41:58,600 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:41:58,600 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:41:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:41:58,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:41:58,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:41:58,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:41:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:41:58,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:41:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:41:58,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:41:58,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:41:58,620 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:41:58,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,624 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:41:58,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,636 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:41:58,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:41:58,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,657 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,659 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,661 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:41:58,663 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,673 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,682 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,692 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,701 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,719 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:58,719 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-03-04 16:41:58,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,743 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,744 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,747 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:41:58,747 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,765 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:58,766 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:41:58,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:41:58,793 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:41:58,793 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:41:58,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:41:58,812 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:41:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:41:58,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:41:58,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-03-04 16:41:58,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:41:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:41:58,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:41:58,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:41:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:41:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:41:58,945 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-03-04 16:42:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:00,213 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-03-04 16:42:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:42:00,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-03-04 16:42:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:00,215 INFO L225 Difference]: With dead ends: 239 [2019-03-04 16:42:00,215 INFO L226 Difference]: Without dead ends: 230 [2019-03-04 16:42:00,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-03-04 16:42:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-03-04 16:42:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-03-04 16:42:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-03-04 16:42:01,272 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-03-04 16:42:01,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:01,273 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-03-04 16:42:01,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:42:01,273 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-03-04 16:42:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-03-04 16:42:01,273 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:01,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:01,273 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:01,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:01,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-03-04 16:42:01,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:01,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:01,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:01,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:01,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:01,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:01,344 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-03-04 16:42:01,345 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-03-04 16:42:01,345 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:01,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:01,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:01,347 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:01,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:01,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:01,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:01,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:01,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:01,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:42:01,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:01,364 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:01,380 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:01,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,396 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:01,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,406 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,416 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:01,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,435 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:01,435 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,445 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,454 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,464 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,473 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,489 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,489 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:01,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:01,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,539 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,539 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:01,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,561 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:01,562 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:01,562 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:01,576 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:01,576 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:42:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:01,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:01,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:01,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-03-04 16:42:01,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:01,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:42:01,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:42:01,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:42:01,631 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-03-04 16:42:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:02,828 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-03-04 16:42:02,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:42:02,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-03-04 16:42:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:02,829 INFO L225 Difference]: With dead ends: 236 [2019-03-04 16:42:02,830 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:42:02,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:42:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-03-04 16:42:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-03-04 16:42:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-03-04 16:42:03,886 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-03-04 16:42:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:03,887 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-03-04 16:42:03,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:42:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-03-04 16:42:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:03,887 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:03,887 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:03,887 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-03-04 16:42:03,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:03,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:03,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:04,084 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 17 [2019-03-04 16:42:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:42:04,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:04,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:04,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:04,120 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-03-04 16:42:04,121 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:04,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:04,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:04,123 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:04,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:04,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:04,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:04,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:04,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:04,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:42:04,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:04,148 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:04,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:04,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:04,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,183 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:04,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,188 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,189 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,191 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,192 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,202 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:04,202 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,211 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,220 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,230 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,239 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,254 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,255 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:04,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,290 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:04,290 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,304 INFO L309 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-03-04 16:42:04,304 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:04,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:04,330 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,343 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,343 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:42:04,361 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,363 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,365 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:04,366 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:04,367 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:04,380 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:04,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:42:04,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:04,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:42:04,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:04,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:42:04,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:42:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:04,455 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-03-04 16:42:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:05,694 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-03-04 16:42:05,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:05,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-03-04 16:42:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:05,696 INFO L225 Difference]: With dead ends: 236 [2019-03-04 16:42:05,696 INFO L226 Difference]: Without dead ends: 227 [2019-03-04 16:42:05,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-03-04 16:42:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-03-04 16:42:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-03-04 16:42:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-03-04 16:42:06,725 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-03-04 16:42:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:06,726 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-03-04 16:42:06,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:42:06,726 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-03-04 16:42:06,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:06,726 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:06,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:06,727 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:06,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:06,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-03-04 16:42:06,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:06,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:06,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:06,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:07,297 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-03-04 16:42:07,489 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2019-03-04 16:42:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:07,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:07,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:07,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:07,542 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:42:07,543 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:07,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:07,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:07,545 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:07,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:07,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:07,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:07,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:07,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:07,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:07,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:42:07,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:07,568 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:07,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,571 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:07,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,577 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:07,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,587 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:07,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,599 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,601 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:07,601 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,611 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,620 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,630 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,639 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,662 INFO L309 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-03-04 16:42:07,662 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:07,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,718 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:07,718 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,740 INFO L309 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-03-04 16:42:07,740 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:07,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:07,787 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,815 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:07,816 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:07,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,841 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,842 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,843 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,851 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:07,851 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,869 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:07,869 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:07,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,899 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,900 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,901 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,902 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,903 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,905 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:07,905 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:07,906 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:07,923 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:07,923 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:07,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:08,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:08,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:42:08,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:08,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:08,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:08,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:08,027 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-03-04 16:42:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:10,044 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-03-04 16:42:10,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:10,044 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:42:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:10,045 INFO L225 Difference]: With dead ends: 326 [2019-03-04 16:42:10,045 INFO L226 Difference]: Without dead ends: 316 [2019-03-04 16:42:10,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:42:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-03-04 16:42:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-03-04 16:42:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-03-04 16:42:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-03-04 16:42:11,155 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-03-04 16:42:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:11,155 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-03-04 16:42:11,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-03-04 16:42:11,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:11,155 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:11,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:11,155 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-03-04 16:42:11,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:11,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:11,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:11,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:11,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:11,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:11,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:11,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:11,267 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-03-04 16:42:11,268 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:11,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:11,270 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:11,271 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:11,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:11,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:11,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:11,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:11,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:11,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:42:11,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:11,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:11,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:11,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,328 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:11,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,349 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:11,355 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,358 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,359 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,369 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:11,369 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,379 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,388 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,398 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,407 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,423 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:11,423 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:11,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,458 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:11,458 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,472 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:11,472 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:11,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,492 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,495 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:11,496 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,513 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:11,513 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:42:11,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:11,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:42:11,537 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:11,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:11,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:42:11,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:11,572 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:11,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-03-04 16:42:11,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:11,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-03-04 16:42:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-03-04 16:42:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:11,618 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-03-04 16:42:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:13,476 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-03-04 16:42:13,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:13,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-03-04 16:42:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:13,478 INFO L225 Difference]: With dead ends: 288 [2019-03-04 16:42:13,478 INFO L226 Difference]: Without dead ends: 279 [2019-03-04 16:42:13,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-03-04 16:42:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-03-04 16:42:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-03-04 16:42:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-03-04 16:42:15,013 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-03-04 16:42:15,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:15,013 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-03-04 16:42:15,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-03-04 16:42:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-03-04 16:42:15,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:15,014 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:15,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:15,015 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-03-04 16:42:15,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:15,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:15,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,191 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-03-04 16:42:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:42:15,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:15,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:15,235 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:15,235 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-03-04 16:42:15,235 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:15,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:15,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:15,238 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:15,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:15,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:15,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:15,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:15,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:15,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:42:15,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:15,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:15,266 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:15,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,278 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:15,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,281 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,282 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,291 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:15,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,299 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,300 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,310 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:15,310 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,320 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,329 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,339 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,348 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,364 INFO L309 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-03-04 16:42:15,364 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:15,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,400 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:15,401 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,414 INFO L309 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-03-04 16:42:15,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:15,434 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,435 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,436 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,438 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,440 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:15,440 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,454 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:15,454 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:42:15,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:15,479 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:15,479 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:15,493 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:15,493 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:34 [2019-03-04 16:42:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:15,515 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:15,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:15,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:15,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:42:15,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:15,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:42:15,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:42:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:15,570 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-03-04 16:42:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:17,454 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-03-04 16:42:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:17,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-03-04 16:42:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:17,456 INFO L225 Difference]: With dead ends: 277 [2019-03-04 16:42:17,456 INFO L226 Difference]: Without dead ends: 268 [2019-03-04 16:42:17,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-03-04 16:42:19,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-03-04 16:42:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-03-04 16:42:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-03-04 16:42:19,053 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-03-04 16:42:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:19,053 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-03-04 16:42:19,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:42:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-03-04 16:42:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:19,054 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:19,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:19,054 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:19,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-03-04 16:42:19,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:19,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:19,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:19,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:19,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:19,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:19,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:19,251 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-03-04 16:42:19,251 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:19,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:19,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:19,253 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:42:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:19,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:19,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:19,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:19,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:19,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:19,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:42:19,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:19,273 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:19,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,278 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:19,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,290 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:19,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:19,302 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,303 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,305 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,306 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,307 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,309 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,310 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,311 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,312 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,312 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:19,313 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,322 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,332 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,342 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,351 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,369 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,369 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:19,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,395 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,399 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,404 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:19,404 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,422 INFO L309 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-03-04 16:42:19,422 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:19,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,451 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,457 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,458 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,459 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:19,460 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,478 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,478 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:19,514 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,518 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,525 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:19,525 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,543 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,543 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:19,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,573 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,574 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,575 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:19,582 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,600 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,600 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:19,628 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:19,638 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:42:19,638 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:19,656 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:19,657 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:42:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:19,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:19,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:42:19,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:19,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:42:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:42:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:19,780 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-03-04 16:42:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:22,602 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-03-04 16:42:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:22,602 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:42:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:22,604 INFO L225 Difference]: With dead ends: 361 [2019-03-04 16:42:22,604 INFO L226 Difference]: Without dead ends: 356 [2019-03-04 16:42:22,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:42:22,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-03-04 16:42:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-03-04 16:42:24,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-03-04 16:42:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-03-04 16:42:24,280 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-03-04 16:42:24,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:24,281 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-03-04 16:42:24,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:42:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-03-04 16:42:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:24,281 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:24,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:24,282 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:24,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-03-04 16:42:24,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:24,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:24,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:24,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:42:24,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:24,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:24,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:24,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:24,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:24,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:24,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:42:24,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:42:24,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:42:24,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:24,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:42:24,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:24,516 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:24,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:24,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,528 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:24,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,534 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,537 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,537 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:24,541 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,542 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,543 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,544 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,551 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,551 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:24,552 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,561 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,571 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,581 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,590 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,608 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,608 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:24,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,638 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:24,645 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,662 INFO L309 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-03-04 16:42:24,663 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:24,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,700 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:24,700 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,718 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:24,719 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:24,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,756 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,757 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:24,757 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,775 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:24,775 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:24,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,803 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,806 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,811 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:24,811 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,829 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:24,829 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:24,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,856 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,857 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,858 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,859 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,860 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,862 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,863 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,864 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:24,864 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:24,865 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:24,883 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:24,883 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:24,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:25,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:25,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:42:25,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:25,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:42:25,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:42:25,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:25,008 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-03-04 16:42:27,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:27,777 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-03-04 16:42:27,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:27,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-03-04 16:42:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:27,779 INFO L225 Difference]: With dead ends: 357 [2019-03-04 16:42:27,779 INFO L226 Difference]: Without dead ends: 352 [2019-03-04 16:42:27,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:42:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-03-04 16:42:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-03-04 16:42:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-03-04 16:42:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-03-04 16:42:29,274 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-03-04 16:42:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:29,274 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-03-04 16:42:29,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:42:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-03-04 16:42:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:29,275 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:29,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:29,275 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:29,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-03-04 16:42:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:29,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:29,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:29,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:29,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:42:29,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:42:29,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:29,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:29,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:42:29,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:42:29,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:42:29,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:42:29,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:42:29,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:29,566 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:29,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,569 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:29,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,581 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:29,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,592 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,597 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:29,601 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,609 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,612 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,617 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:29,618 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,626 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,636 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,645 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,655 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,672 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,672 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:29,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,719 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:29,719 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,737 INFO L309 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-03-04 16:42:29,737 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:29,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,770 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,774 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:29,774 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,792 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,792 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:29,818 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,820 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,823 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,827 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,828 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:29,828 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,846 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:29,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,875 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,876 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,882 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,884 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:29,885 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,903 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,903 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:29,930 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,931 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,933 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:29,940 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:29,941 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:29,959 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:29,959 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:29,988 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:30,070 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:42:30,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:30,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:42:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:42:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:30,089 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-03-04 16:42:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:32,311 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-03-04 16:42:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:42:32,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-03-04 16:42:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:32,313 INFO L225 Difference]: With dead ends: 260 [2019-03-04 16:42:32,313 INFO L226 Difference]: Without dead ends: 253 [2019-03-04 16:42:32,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-03-04 16:42:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-03-04 16:42:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-03-04 16:42:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-03-04 16:42:33,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-03-04 16:42:33,328 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-03-04 16:42:33,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:33,329 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-03-04 16:42:33,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:42:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-03-04 16:42:33,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:33,329 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:33,329 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:33,329 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:33,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-03-04 16:42:33,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:33,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:42:33,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:33,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:33,518 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-03-04 16:42:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:33,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:33,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:33,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:33,600 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:42:33,600 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:33,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:33,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:33,602 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:33,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:33,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:33,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:33,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:33,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:33,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:33,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:42:33,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:33,622 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:33,633 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:33,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,644 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:33,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,659 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:33,663 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,664 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,665 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,666 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,667 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,668 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,677 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:33,678 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,686 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,696 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,705 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,715 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,730 INFO L309 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-03-04 16:42:33,730 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:33,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,770 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:33,770 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,783 INFO L309 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-03-04 16:42:33,784 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-03-04 16:42:33,807 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,808 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,809 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,810 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,811 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,812 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,813 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:33,813 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,827 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:33,827 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:33,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,855 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:33,856 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,869 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:33,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:42:33,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,898 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:33,899 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:42:33,899 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:33,913 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:33,913 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:42:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:33,934 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:34,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:34,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:42:34,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:34,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:42:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:42:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:42:34,007 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-03-04 16:42:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:35,770 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-03-04 16:42:35,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:42:35,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:42:35,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:35,771 INFO L225 Difference]: With dead ends: 202 [2019-03-04 16:42:35,771 INFO L226 Difference]: Without dead ends: 195 [2019-03-04 16:42:35,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:42:35,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-03-04 16:42:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-03-04 16:42:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-03-04 16:42:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-03-04 16:42:36,956 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-03-04 16:42:36,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:36,956 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-03-04 16:42:36,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:42:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-03-04 16:42:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:36,956 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:36,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:36,956 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-03-04 16:42:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:36,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:36,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:42:37,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:37,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:37,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:37,143 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-03-04 16:42:37,144 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:37,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:37,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:37,146 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:37,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:37,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:37,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:37,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:37,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:37,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:42:37,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:37,168 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:37,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,226 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:37,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,317 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:37,367 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,417 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,482 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,482 INFO L301 Elim1Store]: Index analysis took 135 ms [2019-03-04 16:42:37,483 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:37,489 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,491 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,493 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,494 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,495 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,496 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,497 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,498 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,500 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:37,501 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,510 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,520 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,529 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,539 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,556 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,556 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:37,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,582 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,584 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,589 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:37,589 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,607 INFO L309 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-03-04 16:42:37,607 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:37,632 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,633 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,634 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,635 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,636 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,637 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,639 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,640 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,642 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,642 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:37,643 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,661 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:37,661 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:37,688 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,689 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,690 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,691 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,698 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:37,698 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,716 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:37,717 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:37,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:37,754 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:37,754 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:37,773 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:37,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:37,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:42:37,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:37,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:37,873 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-03-04 16:42:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:39,699 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-03-04 16:42:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:39,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:42:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:39,700 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:42:39,701 INFO L226 Difference]: Without dead ends: 192 [2019-03-04 16:42:39,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:42:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-03-04 16:42:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-03-04 16:42:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-03-04 16:42:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-03-04 16:42:40,817 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-03-04 16:42:40,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:40,818 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-03-04 16:42:40,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-03-04 16:42:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:40,818 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:40,818 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:40,818 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:40,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:40,819 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-03-04 16:42:40,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:40,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:40,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:40,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:40,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:40,880 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:40,880 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-03-04 16:42:40,881 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:40,881 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:40,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:40,884 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:42:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:40,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:40,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:40,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:40,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:42:40,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:40,904 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:40,920 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:42:40,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,939 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:42:40,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,957 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:42:40,961 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,962 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,963 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,964 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:40,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:42:41,008 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,018 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,027 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,037 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,046 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,062 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:41,062 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-03-04 16:42:41,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,089 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:41,092 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,104 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:41,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-03-04 16:42:41,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,125 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,127 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,128 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:42:41,129 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,142 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:41,143 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:42:41,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:41,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:42:41,164 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:41,178 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:41,178 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-03-04 16:42:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:41,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-03-04 16:42:41,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:41,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-03-04 16:42:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-03-04 16:42:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:42:41,241 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-03-04 16:42:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:42,802 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-03-04 16:42:42,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:42:42,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-03-04 16:42:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:42,803 INFO L225 Difference]: With dead ends: 196 [2019-03-04 16:42:42,804 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:42:42,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:42:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:42:44,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-03-04 16:42:44,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-03-04 16:42:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-03-04 16:42:44,159 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-03-04 16:42:44,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:44,160 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-03-04 16:42:44,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-03-04 16:42:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-03-04 16:42:44,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:44,160 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:44,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:44,160 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:44,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:44,161 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-03-04 16:42:44,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:44,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:42:44,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:44,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:44,276 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:44,276 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-03-04 16:42:44,276 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:44,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:44,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:44,278 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:44,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:44,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:44,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:44,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:44,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:44,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:44,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:42:44,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:44,296 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:44,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,308 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:44,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,319 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:44,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:44,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,337 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,338 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,339 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,340 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,343 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:44,343 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,353 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,363 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,372 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,382 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,399 INFO L309 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-03-04 16:42:44,399 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:44,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,421 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,423 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,424 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,430 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:44,430 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,448 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:44,449 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:44,472 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,473 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,475 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,476 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,477 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,478 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,479 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,480 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,481 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,482 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:44,482 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,500 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:44,501 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:44,522 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,523 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,524 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:44,532 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:44,532 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:44,551 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:44,551 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:44,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:44,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:44,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-03-04 16:42:44,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:44,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:44,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:44,638 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-03-04 16:42:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:46,412 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-03-04 16:42:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:46,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:42:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:46,413 INFO L225 Difference]: With dead ends: 203 [2019-03-04 16:42:46,414 INFO L226 Difference]: Without dead ends: 194 [2019-03-04 16:42:46,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-03-04 16:42:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-03-04 16:42:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-03-04 16:42:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-03-04 16:42:47,825 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-03-04 16:42:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:47,825 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-03-04 16:42:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:42:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-03-04 16:42:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:47,825 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:47,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:47,826 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-03-04 16:42:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:47,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:47,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:47,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:47,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:47,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:47,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:47,966 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:47,966 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-03-04 16:42:47,967 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:47,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:47,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:47,969 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:47,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:47,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:47,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:47,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:47,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:42:47,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:47,989 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:47,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:47,992 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:47,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:47,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:47,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:47,999 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:48,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,008 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,009 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,009 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:48,012 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,015 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,017 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,019 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,021 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,023 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,024 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,026 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:48,026 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,036 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,046 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,055 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,065 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,082 INFO L309 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-03-04 16:42:48,083 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:48,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,112 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,114 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,119 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:48,119 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,137 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,137 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:48,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,164 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,165 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,166 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,167 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,172 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:48,173 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,191 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,191 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:48,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,226 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,228 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:48,229 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,247 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,247 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:48,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,280 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:48,281 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:42:48,281 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:48,300 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:48,300 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:42:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:48,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:48,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:48,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:42:48,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:48,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:48,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:48,389 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-03-04 16:42:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:50,855 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-03-04 16:42:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:42:50,856 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:42:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:50,857 INFO L225 Difference]: With dead ends: 269 [2019-03-04 16:42:50,857 INFO L226 Difference]: Without dead ends: 265 [2019-03-04 16:42:50,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-03-04 16:42:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-03-04 16:42:52,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-03-04 16:42:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-03-04 16:42:52,592 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-03-04 16:42:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:52,592 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-03-04 16:42:52,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-03-04 16:42:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:52,593 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:52,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:52,593 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-03-04 16:42:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:52,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:52,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:52,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:42:52,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:52,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:52,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:52,729 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-03-04 16:42:52,729 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:52,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:52,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:52,732 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-03-04 16:42:52,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:52,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:52,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:52,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:52,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:52,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:52,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:42:52,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:52,753 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:52,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,758 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:52,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,767 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:52,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,783 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:52,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,796 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:52,796 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,806 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,815 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,825 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,835 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,852 INFO L309 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-03-04 16:42:52,852 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:52,877 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,878 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,879 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,880 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,881 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,883 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,884 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,885 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,886 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,886 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:52,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,905 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:52,905 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:52,932 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,934 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,935 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,936 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,937 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,938 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,939 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,940 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,941 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,942 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,943 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:52,943 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:52,960 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:52,961 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:52,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:52,997 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:52,998 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:53,016 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:53,016 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:42:53,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,048 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,049 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:53,052 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:42:53,052 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:53,071 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:53,071 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:42:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:53,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:53,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:53,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-03-04 16:42:53,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:53,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:42:53,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:42:53,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-03-04 16:42:53,161 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-03-04 16:42:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:55,604 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-03-04 16:42:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:42:55,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-03-04 16:42:55,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:55,605 INFO L225 Difference]: With dead ends: 253 [2019-03-04 16:42:55,606 INFO L226 Difference]: Without dead ends: 249 [2019-03-04 16:42:55,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:42:55,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-03-04 16:42:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-03-04 16:42:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:42:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-03-04 16:42:57,394 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-03-04 16:42:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:42:57,395 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-03-04 16:42:57,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:42:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-03-04 16:42:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:42:57,395 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:42:57,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:42:57,395 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:42:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:57,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-03-04 16:42:57,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:42:57,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:57,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:42:57,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:42:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-03-04 16:42:57,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:57,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:42:57,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:42:57,487 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-03-04 16:42:57,488 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:42:57,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:42:57,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:42:57,490 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-03-04 16:42:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:42:57,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:42:57,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:42:57,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:42:57,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:42:57,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:42:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:42:57,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:42:57,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:42:57,515 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:42:57,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,520 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:42:57,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,530 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:42:57,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,545 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,546 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,548 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,549 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,550 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,550 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:42:57,554 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,555 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,556 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,557 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,558 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,559 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,560 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,562 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,563 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,564 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:42:57,565 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,574 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,584 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,593 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,603 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,620 INFO L309 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-03-04 16:42:57,621 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:42:57,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,649 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,650 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,651 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,653 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,654 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:57,655 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,673 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:57,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:42:57,695 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,697 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,699 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,701 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,705 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:42:57,705 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,723 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:57,723 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:42:57,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:42:57,755 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:42:57,756 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:42:57,773 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:42:57,773 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-03-04 16:42:57,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:57,808 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:42:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:42:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:42:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-03-04 16:42:57,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:42:57,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:42:57,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:42:57,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:42:57,856 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-03-04 16:42:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:42:59,945 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-03-04 16:42:59,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:42:59,946 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-03-04 16:42:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:42:59,946 INFO L225 Difference]: With dead ends: 226 [2019-03-04 16:42:59,947 INFO L226 Difference]: Without dead ends: 217 [2019-03-04 16:42:59,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:42:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-03-04 16:43:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-03-04 16:43:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-03-04 16:43:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-03-04 16:43:01,727 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-03-04 16:43:01,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:01,727 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-03-04 16:43:01,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:43:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-03-04 16:43:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:43:01,728 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:01,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:01,728 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-03-04 16:43:01,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:01,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:01,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:01,962 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-03-04 16:43:02,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:43:02,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:02,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:02,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:02,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:02,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:02,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:02,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:02,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:02,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:43:02,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:02,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:43:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:02,092 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:02,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,096 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:02,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,102 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:02,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,110 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,112 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:02,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,116 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,118 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,129 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:02,133 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,143 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,152 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,162 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,172 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,189 INFO L309 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-03-04 16:43:02,189 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:02,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,224 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,226 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:02,226 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,244 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:02,245 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:02,268 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,274 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:02,279 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:02,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:02,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,325 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,327 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,332 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:02,332 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,350 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:02,351 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:02,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,381 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,386 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:02,389 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:02,389 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:02,408 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:02,408 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:02,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:02,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:02,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:02,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:43:02,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:02,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:43:02,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:43:02,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:02,521 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-03-04 16:43:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:05,086 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-03-04 16:43:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:05,087 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:43:05,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:05,088 INFO L225 Difference]: With dead ends: 258 [2019-03-04 16:43:05,088 INFO L226 Difference]: Without dead ends: 251 [2019-03-04 16:43:05,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-03-04 16:43:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-03-04 16:43:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-03-04 16:43:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-03-04 16:43:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-03-04 16:43:06,816 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-03-04 16:43:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:06,816 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-03-04 16:43:06,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:43:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-03-04 16:43:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:43:06,817 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:06,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:06,817 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:06,817 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-03-04 16:43:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:06,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:06,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:06,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:06,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:06,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:06,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:06,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:06,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:06,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:07,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:07,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:07,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:43:07,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:07,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:43:07,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:07,016 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:07,032 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:43:07,036 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,046 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:43:07,050 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,051 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,061 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:43:07,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,067 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,068 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,069 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,070 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,080 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:43:07,080 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,090 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,099 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,109 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,118 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,133 INFO L309 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-03-04 16:43:07,134 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-03-04 16:43:07,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,169 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,171 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,174 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:43:07,175 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,188 INFO L309 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-03-04 16:43:07,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2019-03-04 16:43:07,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,217 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:43:07,217 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,229 INFO L309 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-03-04 16:43:07,229 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-03-04 16:43:07,251 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,252 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,253 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,255 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,256 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,256 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:43:07,257 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,270 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:07,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-03-04 16:43:07,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,296 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,297 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,298 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:07,299 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:43:07,299 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:07,313 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:07,313 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:43:07,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:07,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:07,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:07,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:43:07,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:07,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:43:07,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:43:07,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:07,409 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-03-04 16:43:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:10,207 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-03-04 16:43:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:10,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:43:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:10,208 INFO L225 Difference]: With dead ends: 279 [2019-03-04 16:43:10,208 INFO L226 Difference]: Without dead ends: 272 [2019-03-04 16:43:10,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:43:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-03-04 16:43:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-03-04 16:43:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-03-04 16:43:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-03-04 16:43:12,242 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-03-04 16:43:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:12,242 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-03-04 16:43:12,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:43:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-03-04 16:43:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:43:12,243 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:12,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:12,243 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-03-04 16:43:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:12,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:12,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:12,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:12,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:12,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:12,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:12,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:12,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:12,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:12,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:12,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:12,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:43:12,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:12,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:43:12,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:12,502 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:12,505 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,506 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:12,509 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,510 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,511 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,512 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:12,515 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,517 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,519 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,520 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,521 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,521 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:12,525 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,526 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,527 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,528 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,529 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,530 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,531 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,532 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,533 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,535 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,535 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:12,535 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,545 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,555 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,564 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,574 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,590 INFO L309 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-03-04 16:43:12,590 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:12,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,619 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,625 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:12,626 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,644 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:12,644 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:12,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,671 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,680 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:12,680 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,697 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:12,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:12,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,732 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:12,733 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,750 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:12,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:12,777 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:12,788 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:12,788 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:12,806 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:12,807 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:12,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:12,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:12,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-03-04 16:43:12,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:12,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-03-04 16:43:12,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-03-04 16:43:12,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:43:12,910 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-03-04 16:43:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:15,558 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-03-04 16:43:15,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:15,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-03-04 16:43:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:15,560 INFO L225 Difference]: With dead ends: 256 [2019-03-04 16:43:15,560 INFO L226 Difference]: Without dead ends: 249 [2019-03-04 16:43:15,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:43:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-03-04 16:43:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-03-04 16:43:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-03-04 16:43:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-03-04 16:43:17,567 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-03-04 16:43:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:17,567 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-03-04 16:43:17,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-03-04 16:43:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-03-04 16:43:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:43:17,567 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:17,567 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:17,568 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:17,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:17,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-03-04 16:43:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:17,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:17,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:17,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:17,711 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-03-04 16:43:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-03-04 16:43:17,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:17,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:17,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:17,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:17,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:17,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:17,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:17,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:17,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:43:17,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:17,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 9 conjunts are in the unsatisfiable core [2019-03-04 16:43:17,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:17,802 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:17,946 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 26 [2019-03-04 16:43:17,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,135 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 28 [2019-03-04 16:43:18,186 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,211 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,372 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 30 [2019-03-04 16:43:18,419 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,487 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,508 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,536 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,536 INFO L301 Elim1Store]: Index analysis took 138 ms [2019-03-04 16:43:18,561 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 29 [2019-03-04 16:43:18,562 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,570 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,580 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,589 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,598 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,614 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:18,614 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-03-04 16:43:18,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,644 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,646 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,647 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,648 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,650 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-03-04 16:43:18,650 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,664 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:18,664 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2019-03-04 16:43:18,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,685 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:43:18,685 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,699 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:18,699 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-03-04 16:43:18,718 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,723 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,724 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-03-04 16:43:18,725 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,738 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:18,739 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:34 [2019-03-04 16:43:18,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:18,763 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2019-03-04 16:43:18,764 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:18,777 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:18,778 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-03-04 16:43:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:18,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:18,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-03-04 16:43:18,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:18,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:43:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:43:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-03-04 16:43:18,868 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-03-04 16:43:21,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:21,254 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-03-04 16:43:21,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-03-04 16:43:21,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-03-04 16:43:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:21,255 INFO L225 Difference]: With dead ends: 234 [2019-03-04 16:43:21,256 INFO L226 Difference]: Without dead ends: 207 [2019-03-04 16:43:21,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:43:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-03-04 16:43:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-03-04 16:43:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-03-04 16:43:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-03-04 16:43:21,718 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-03-04 16:43:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:21,719 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-03-04 16:43:21,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:43:21,719 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-03-04 16:43:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:43:21,719 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:21,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:21,719 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-03-04 16:43:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:21,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:21,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:21,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:21,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:21,949 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-03-04 16:43:21,949 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-03-04 16:43:21,950 INFO L148 AbstractInterpreter]: Using domain OctagonDomain [2019-03-04 16:43:21,950 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:43:21,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:43:21,952 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-03-04 16:43:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:21,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:43:21,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:21,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:21,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:21,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:21,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:21,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:21,970 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:21,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,976 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:21,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,985 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:21,988 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,991 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,994 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:21,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:21,999 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,001 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,003 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,004 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,005 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,006 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,007 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,008 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:22,008 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,018 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,027 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,037 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,046 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,064 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,064 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:22,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,093 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,101 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,102 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:22,102 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,120 INFO L309 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-03-04 16:43:22,121 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:43:22,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,155 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,157 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,158 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,159 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,160 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,161 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,162 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,163 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,164 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:22,164 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,182 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:22,182 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-03-04 16:43:22,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,214 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,217 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,220 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,221 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,223 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:22,223 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,241 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:22,242 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:22,269 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,270 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,271 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,272 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,275 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,276 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,277 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,278 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,279 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:22,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,297 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:22,297 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:22,326 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,328 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,331 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,332 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,334 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,336 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:22,337 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:22,337 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:22,355 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:22,355 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:22,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:22,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:22,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:22,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-03-04 16:43:22,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:22,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:43:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:43:22,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:43:22,496 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-03-04 16:43:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:23,801 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-03-04 16:43:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:43:23,802 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-03-04 16:43:23,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:23,802 INFO L225 Difference]: With dead ends: 76 [2019-03-04 16:43:23,803 INFO L226 Difference]: Without dead ends: 69 [2019-03-04 16:43:23,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-03-04 16:43:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-03-04 16:43:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-03-04 16:43:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-03-04 16:43:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-03-04 16:43:24,314 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-03-04 16:43:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:24,314 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-03-04 16:43:24,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:43:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-03-04 16:43:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:43:24,315 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:24,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:24,315 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-03-04 16:43:24,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:24,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:24,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:24,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:24,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:24,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:24,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:24,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:24,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:43:24,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:43:24,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:43:24,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:24,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:24,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:24,586 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:24,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,591 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:24,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,596 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,597 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:24,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,603 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,607 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,608 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:24,611 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,613 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,614 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,615 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,617 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,630 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,631 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:24,631 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,640 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,650 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,659 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,668 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,684 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,684 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:24,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,715 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,717 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,720 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:24,721 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,749 INFO L309 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-03-04 16:43:24,750 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:43:24,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,778 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,779 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,780 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,781 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,784 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,787 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:24,787 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,805 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:24,806 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:24,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,833 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,835 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,836 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,837 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,839 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,840 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,841 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:24,841 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,859 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:24,859 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:24,888 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,889 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,890 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,891 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,892 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,893 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,894 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,895 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,896 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,897 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,898 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:24,898 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,917 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:24,917 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:24,944 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,945 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,947 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,948 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,950 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,951 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,952 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,953 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,954 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:24,955 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:24,955 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:24,973 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:24,973 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:25,003 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:25,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:25,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:43:25,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:25,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:43:25,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:43:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:43:25,099 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-03-04 16:43:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:26,342 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-03-04 16:43:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:43:26,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:43:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:26,343 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:43:26,343 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:43:26,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:43:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:43:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-03-04 16:43:26,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:43:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-03-04 16:43:26,806 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-03-04 16:43:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:26,806 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-03-04 16:43:26,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:43:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-03-04 16:43:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:43:26,807 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:26,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:26,807 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:26,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:26,807 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-03-04 16:43:26,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:26,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:26,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:26,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:27,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:27,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:27,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:27,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:27,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:27,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:27,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:43:27,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:43:27,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:43:27,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:43:27,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:27,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:27,105 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:27,109 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,109 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:27,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,120 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,122 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,122 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:27,126 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,128 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,131 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,132 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,133 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,133 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:27,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,139 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,141 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,147 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:27,147 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,157 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,166 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,176 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,185 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,203 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,203 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:27,228 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,230 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,232 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,233 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,235 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,236 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,238 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,239 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:27,239 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,257 INFO L309 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-03-04 16:43:27,257 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-03-04 16:43:27,285 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,286 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,288 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,289 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,291 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,293 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,294 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:27,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,314 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:27,314 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:27,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,352 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:27,352 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,370 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:27,371 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:27,401 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,402 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,403 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,404 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,405 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,409 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,410 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:27,411 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,433 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:27,433 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:27,459 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,460 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,461 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,462 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,463 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,464 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,465 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,466 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,467 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,468 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:27,469 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:27,469 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:27,487 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:27,488 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:27,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-03-04 16:43:27,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:27,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:43:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:43:27,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:43:27,605 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-03-04 16:43:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:29,366 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-03-04 16:43:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:43:29,366 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-03-04 16:43:29,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:29,366 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:43:29,367 INFO L226 Difference]: Without dead ends: 84 [2019-03-04 16:43:29,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:43:29,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-03-04 16:43:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-03-04 16:43:30,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-03-04 16:43:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-03-04 16:43:30,132 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-03-04 16:43:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:30,133 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-03-04 16:43:30,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:43:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-03-04 16:43:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-03-04 16:43:30,133 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:43:30,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:43:30,133 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:43:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:43:30,133 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-03-04 16:43:30,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:43:30,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:30,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:43:30,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:43:30,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:43:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:30,327 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 23 [2019-03-04 16:43:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:43:30,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:43:30,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:43:30,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:43:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:43:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 16:43:30,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:43:30,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:43:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:43:30,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:43:30,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:43:30,544 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-03-04 16:43:30,567 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,567 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-03-04 16:43:30,570 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,571 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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-03-04 16:43:30,576 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,577 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,578 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,580 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,582 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-03-04 16:43:30,585 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,586 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,587 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,588 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,589 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,590 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,591 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,593 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,594 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,595 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-03-04 16:43:30,596 INFO L309 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,605 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,615 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,624 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,634 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,651 INFO L309 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,652 INFO L209 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-03-04 16:43:30,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,685 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,686 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2019-03-04 16:43:30,687 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,705 INFO L309 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-03-04 16:43:30,705 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-03-04 16:43:30,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,735 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,742 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-03-04 16:43:30,742 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,760 INFO L309 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-03-04 16:43:30,760 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-03-04 16:43:30,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,792 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,796 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,799 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:30,800 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,818 INFO L309 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:30,818 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:30,845 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,847 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,848 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,849 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,850 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,851 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,852 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,853 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,854 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,855 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:30,855 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,873 INFO L309 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:30,873 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:30,906 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,908 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,909 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,910 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,911 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,912 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,913 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,914 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,915 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,916 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:43:30,917 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2019-03-04 16:43:30,917 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:43:30,935 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:43:30,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-03-04 16:43:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:30,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:43:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:43:31,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:43:31,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-03-04 16:43:31,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:43:31,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-03-04 16:43:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-03-04 16:43:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-03-04 16:43:31,068 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-03-04 16:43:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:43:32,536 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-03-04 16:43:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:43:32,536 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-03-04 16:43:32,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:43:32,537 INFO L225 Difference]: With dead ends: 67 [2019-03-04 16:43:32,537 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:43:32,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:43:32,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:43:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:43:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:43:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:43:32,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-03-04 16:43:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:43:32,538 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:43:32,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-03-04 16:43:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:43:32,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:43:32,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:43:32,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:33,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:34,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:34,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:35,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:36,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:36,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:37,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:38,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:40,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:41,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:42,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:42,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:42,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:46,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:49,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:49,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:49,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:49,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:51,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:51,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:52,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:43:57,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:02,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:02,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:02,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:03,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:06,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:07,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:07,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:07,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:07,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:08,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:09,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:09,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:09,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:12,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:13,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:14,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:14,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:14,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:14,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:14,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:16,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:16,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:17,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:18,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:18,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:31,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:37,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:44:50,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:14,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:14,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:14,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:25,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:37,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:37,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:37,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:46,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:46,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:46,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:50,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:52,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-03-04 16:45:55,701 WARN L181 SmtUtils]: Spent 2.39 m on a formula simplification. DAG size of input: 5137 DAG size of output: 3945 [2019-03-04 16:49:06,301 WARN L181 SmtUtils]: Spent 3.18 m on a formula simplification. DAG size of input: 3619 DAG size of output: 132 [2019-03-04 16:49:06,304 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-03-04 16:49:06,304 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-03-04 16:49:06,305 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-03-04 16:49:06,306 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse22 (select |#memory_int| ULTIMATE.start_main_p5)) (.cse35 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse38 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse35 (- 1)))) (.cse6 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse22 1)))) (let ((.cse33 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse4 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse23 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse5 (select .cse6 ULTIMATE.start_main_p2)) (.cse39 (select .cse38 ULTIMATE.start_main_p1))) (let ((.cse15 (select .cse6 ULTIMATE.start_main_p4)) (.cse20 (<= 1 .cse39)) (.cse21 (<= (+ .cse5 1) 0)) (.cse3 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse9 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) (.cse34 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse23 (- 1)))) (.cse26 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse24 (= .cse4 0)) (.cse29 (= .cse39 0)) (.cse30 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse27 (= (select .cse38 ULTIMATE.start_main_p2) 0)) (.cse28 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5))) (.cse31 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse32 (and (<= 0 .cse39) .cse33)) (.cse25 (select .cse38 ULTIMATE.start_main_p3))) (let ((.cse7 (<= 1 (select .cse38 ULTIMATE.start_main_p5))) (.cse8 (= .cse25 0)) (.cse10 (let ((.cse36 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5))) (.cse37 (and .cse29 .cse30 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (and .cse27 .cse28 .cse31 .cse32)))) (or (and .cse26 .cse36 .cse37) (and .cse36 .cse37 .cse24 (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))))))) (.cse0 (= 0 .cse22)) (.cse2 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse11 (= .cse35 0)) (.cse13 (<= 0 (select .cse34 ULTIMATE.start_main_p5))) (.cse16 (<= 0 .cse25)) (.cse17 (and .cse28 .cse21 .cse3 (and .cse29 .cse30 .cse33) .cse9)) (.cse1 (select .cse34 ULTIMATE.start_main_p1)) (.cse19 (and .cse27 (and .cse20 .cse33) .cse28 .cse3 .cse31)) (.cse12 (and .cse26 (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) .cse27 .cse28 .cse29 .cse30 .cse3 .cse31 .cse32))) (.cse14 (<= (+ .cse15 1) 0))) (or (and .cse0 (= 0 .cse1) (= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p3) 0) .cse3 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse4 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse5 0) (= (select .cse6 ULTIMATE.start_main_p1) 0) (= (select .cse6 ULTIMATE.start_main_p3) 0)) (and .cse7 .cse8 .cse9 (and .cse3 .cse10) .cse11) (and .cse12 .cse13 (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p5)) (<= 1 .cse4) .cse11) (and (and .cse7 (and .cse3 .cse8 .cse14 .cse10)) .cse9) (and (= 0 .cse15) (and .cse16 (let ((.cse18 (<= 0 .cse22))) (or (and .cse17 .cse18) (and .cse19 .cse18) (and .cse20 .cse21 .cse18))))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 .cse23) .cse24 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) .cse0 (= .cse2 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) .cse11 (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and .cse13 (or (and .cse16 (and (or (or .cse17 (and (<= 1 .cse1) .cse21)) .cse19) .cse14)) (and (and (<= 1 .cse25) .cse12) .cse14))))))))) [2019-03-04 16:49:06,333 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:49:06 BoogieIcfgContainer [2019-03-04 16:49:06,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:49:06,335 INFO L168 Benchmark]: Toolchain (without parser) took 626408.33 ms. Allocated memory was 140.5 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 108.0 MB in the beginning and 349.1 MB in the end (delta: -241.0 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-03-04 16:49:06,335 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:49:06,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.84 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:49:06,336 INFO L168 Benchmark]: Boogie Preprocessor took 35.42 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:49:06,336 INFO L168 Benchmark]: RCFGBuilder took 461.35 ms. Allocated memory is still 140.5 MB. Free memory was 104.2 MB in the beginning and 93.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:49:06,336 INFO L168 Benchmark]: TraceAbstraction took 625846.11 ms. Allocated memory was 140.5 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 92.8 MB in the beginning and 349.1 MB in the end (delta: -256.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-03-04 16:49:06,337 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.84 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.42 ms. Allocated memory is still 140.5 MB. Free memory was 105.5 MB in the beginning and 104.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 461.35 ms. Allocated memory is still 140.5 MB. Free memory was 104.2 MB in the beginning and 93.3 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 625846.11 ms. Allocated memory was 140.5 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 92.8 MB in the beginning and 349.1 MB in the end (delta: -256.2 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((0 == #memory_int[p5] && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p3] == 0) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p1] == 0) && #memory_int[p5 := #memory_int[p5] + 1][p3] == 0) || ((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p5] && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && !(p3 == p1)) && !(p3 == p2) && (((!(p3 == p4) && !(p3 == p5)) && ((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p2 == p1)) && ((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) || (((!(p3 == p5) && ((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p2 == p1)) && ((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && #memory_int[p3] == 0) && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p5 : int :: ((p3 < ULTIMATE.start_main_p4 && #memory_int[ULTIMATE.start_main_p4] + 1 == 0) && 1 == #memory_int[ULTIMATE.start_main_p5]) && ULTIMATE.start_main_p4 < ULTIMATE.start_main_p5)))) && #memory_int[p4] == 0)) || (((((!(p3 == p4) && ((((((!(p1 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p2 == p5)) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p5]) && !(p4 == p5)) && 1 <= #memory_int[p3]) && #memory_int[p4] == 0)) || ((1 <= #memory_int[p4 := #memory_int[p4] + -1][p5] && ((!(p3 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p3] == 0) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) && (((!(p3 == p4) && !(p3 == p5)) && ((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p2 == p1)) && ((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) || (((!(p3 == p5) && ((#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p2 == p1)) && ((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && !(p2 == p5)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && #memory_int[p3] == 0) && (exists ULTIMATE.start_main_p4 : int, ULTIMATE.start_main_p5 : int :: ((p3 < ULTIMATE.start_main_p4 && #memory_int[ULTIMATE.start_main_p4] + 1 == 0) && 1 == #memory_int[ULTIMATE.start_main_p5]) && ULTIMATE.start_main_p4 < ULTIMATE.start_main_p5)))) && !(p3 == p1))) || (0 == #memory_int[p5 := #memory_int[p5] + 1][p4] && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && (((((((!(p2 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && (#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p1 == p4)) && !(p3 == p1)) && 0 <= #memory_int[p5]) || (((((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && !(p2 == p5)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p5])) || ((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 <= #memory_int[p5])))) || ((((((((p3 < p4 && 0 == #memory_int[p2]) && #memory_int[p3] == 0) && p2 < p3) && 0 == #memory_int[p5]) && #memory_int[p1] == 0) && p4 < p5) && #memory_int[p4] == 0) && p1 < p2)) || (0 <= #memory_int[p2 := #memory_int[p2] + -1][p5] && ((0 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && ((((((!(p2 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && !(p3 == p2)) && (#memory_int[p4 := #memory_int[p4] + -1][p1] == 0 && !(p1 == p5)) && !(p1 == p4)) && !(p3 == p1)) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0)) || ((((#memory_int[p4 := #memory_int[p4] + -1][p2] == 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && !(p2 == p5)) && !(p3 == p2)) && !(p2 == p4))) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || ((1 <= #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p3 == p4) && ((((((!(p1 == p2) && #memory_int[p4 := #memory_int[p4] + -1][p2] == 0) && !(p2 == p5)) && #memory_int[p4 := #memory_int[p4] + -1][p1] == 0) && !(p1 == p5)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && !(p1 == p4)) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 625.7s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 137.7s AutomataDifference, 0.0s DeadEndRemovalTime, 333.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 50.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 59.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 58.2s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 1038 HoareAnnotationTreeSize, 1 FomulaSimplifications, 5840147798833964 FormulaSimplificationTreeSizeReduction, 143.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 189104957629 FormulaSimplificationTreeSizeReductionInter, 190.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 88.7s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...