java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:51:37,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:51:37,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:51:37,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:51:37,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:51:37,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:51:37,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:51:37,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:51:37,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:51:37,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:51:37,648 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:51:37,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:51:37,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:51:37,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:51:37,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:51:37,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:51:37,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:51:37,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:51:37,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:51:37,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:51:37,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:51:37,662 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:51:37,664 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:51:37,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:51:37,665 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:51:37,666 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:51:37,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:51:37,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:51:37,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:51:37,669 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:51:37,670 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:51:37,670 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:51:37,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:51:37,671 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:51:37,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:51:37,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:51:37,673 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:51:37,687 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:51:37,687 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:51:37,688 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:51:37,688 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:51:37,688 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:51:37,688 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:51:37,689 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:51:37,689 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:51:37,689 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:51:37,689 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:51:37,689 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:51:37,690 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:51:37,690 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:51:37,690 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:51:37,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:51:37,691 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:51:37,691 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:51:37,691 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:51:37,691 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:51:37,692 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:51:37,693 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:51:37,693 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:51:37,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:51:37,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:51:37,693 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:51:37,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:37,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:51:37,694 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:51:37,694 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:51:37,694 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:51:37,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:51:37,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:51:37,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:51:37,695 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:51:37,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:51:37,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:51:37,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:51:37,741 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:51:37,742 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:51:37,742 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl [2019-02-25 15:51:37,743 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-25 15:51:37,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:51:37,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:51:37,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:37,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:51:37,780 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:51:37,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:37,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:51:37,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:51:37,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:51:37,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/1) ... [2019-02-25 15:51:37,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:51:37,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:51:37,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:51:37,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:51:37,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (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-02-25 15:51:37,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:51:37,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:51:38,159 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:51:38,160 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-25 15:51:38,161 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:38 BoogieIcfgContainer [2019-02-25 15:51:38,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:51:38,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:51:38,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:51:38,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:51:38,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:37" (1/2) ... [2019-02-25 15:51:38,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bab3879 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:51:38, skipping insertion in model container [2019-02-25 15:51:38,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:38" (2/2) ... [2019-02-25 15:51:38,169 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-25 15:51:38,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:51:38,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-25 15:51:38,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-25 15:51:38,241 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:51:38,242 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:51:38,242 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:51:38,242 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:51:38,242 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:51:38,242 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:51:38,243 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:51:38,243 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:51:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-25 15:51:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:51:38,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:38,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:51:38,267 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:38,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:38,272 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-25 15:51:38,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:38,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:38,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:38,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:38,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:38,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:38,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:38,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:38,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:38,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:38,513 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-25 15:51:38,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:38,689 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-25 15:51:38,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:38,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:51:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:38,704 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:51:38,704 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:51:38,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:51:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-25 15:51:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:51:38,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-25 15:51:38,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-25 15:51:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:38,745 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-25 15:51:38,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-25 15:51:38,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:38,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:38,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:38,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:38,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:38,747 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-25 15:51:38,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:38,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:38,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:38,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:38,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:38,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:38,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:38,990 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:38,995 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-25 15:51:39,059 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:39,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:42,622 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:42,624 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:42,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:42,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:42,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:42,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:42,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:51:42,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:42,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:42,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,780 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:42,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:42,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:42,924 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:42,930 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,034 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,051 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,175 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:43,362 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,438 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,454 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,471 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,528 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:43,529 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:43,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:43,643 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:43,644 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:43,696 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:43,697 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:43,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:43,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:43,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:43,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:43,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:43,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:43,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:43,840 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-25 15:51:43,988 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-02-25 15:51:44,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:44,195 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-25 15:51:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:44,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:51:44,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:44,199 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:51:44,199 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:51:44,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:51:44,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:51:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-25 15:51:44,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:51:44,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-25 15:51:44,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-25 15:51:44,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:44,209 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-25 15:51:44,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-25 15:51:44,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:44,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:44,212 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:44,213 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-25 15:51:44,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:44,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:44,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:44,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:44,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:44,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:44,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:44,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:44,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:44,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:44,314 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-25 15:51:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:44,555 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-25 15:51:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:44,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:51:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:44,557 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:51:44,557 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:51:44,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:44,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:51:44,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-25 15:51:44,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:51:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-25 15:51:44,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-25 15:51:44,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:44,562 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-25 15:51:44,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:44,562 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-25 15:51:44,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:44,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:44,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:44,563 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:44,563 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-25 15:51:44,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:44,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:44,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:44,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:44,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:44,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:44,653 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:44,653 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-25 15:51:44,655 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:44,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:44,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:44,951 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:44,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:44,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:44,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:44,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:44,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:44,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:51:44,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:45,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:45,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:45,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:45,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:45,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:45,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:45,203 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:51:45,203 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,277 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,290 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,299 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:45,341 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,395 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,403 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,419 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:45,420 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-25 15:51:45,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:45,470 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:51:45,471 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,481 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:45,482 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:51:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-25 15:51:45,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:45,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:45,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:45,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:45,539 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-25 15:51:45,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:45,602 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-25 15:51:45,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:51:45,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:51:45,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:45,603 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:51:45,603 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:51:45,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:45,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:51:45,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-25 15:51:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:51:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-25 15:51:45,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-25 15:51:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:45,611 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-25 15:51:45,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:45,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-25 15:51:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:45,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:45,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:45,612 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:45,613 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-25 15:51:45,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:45,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:45,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:45,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:45,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:45,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:45,661 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:45,661 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-25 15:51:45,663 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:45,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:45,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:45,881 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:45,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:45,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:45,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:45,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:45,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:45,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:45,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:51:45,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:45,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:45,961 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,971 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:45,978 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:46,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:46,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:46,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:51:46,044 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,139 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,149 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,159 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,184 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:46,185 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-25 15:51:46,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:46,232 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:51:46,232 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:46,251 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:46,252 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:51:46,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:46,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:46,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:46,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:46,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:46,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:46,304 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-25 15:51:46,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:46,471 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-25 15:51:46,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:46,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:51:46,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:46,473 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:51:46,473 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:51:46,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:51:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:51:46,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-25 15:51:46,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:51:46,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-25 15:51:46,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-25 15:51:46,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:46,480 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-25 15:51:46,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:46,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-25 15:51:46,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:46,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:46,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:46,481 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:46,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:46,481 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-25 15:51:46,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:46,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:46,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:46,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:46,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:46,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:46,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:46,591 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-25 15:51:46,593 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:46,593 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:48,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:48,370 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:48,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:48,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:48,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:48,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:48,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:48,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:51:48,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:48,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:48,430 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,446 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,456 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,476 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,498 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:48,502 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:48,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:48,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:48,511 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,535 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,548 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,558 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,587 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:48,587 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:48,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:48,614 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:48,615 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:48,633 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:48,633 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:48,652 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:48,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:48,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:51:48,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:48,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:48,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:48,679 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-25 15:51:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:48,713 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-25 15:51:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:48,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:51:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:48,714 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:51:48,714 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:51:48,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:51:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-25 15:51:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:51:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-25 15:51:48,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-25 15:51:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:48,722 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-25 15:51:48,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:48,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-25 15:51:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:48,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:48,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:48,723 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:48,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:48,723 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-25 15:51:48,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:48,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:48,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:48,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:48,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:48,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-02-25 15:51:48,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:48,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:48,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:48,788 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-25 15:51:48,791 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:48,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:49,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:49,355 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:49,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:49,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:49,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:49,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:49,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:49,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:51:49,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:49,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:49,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,397 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:49,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:49,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:49,420 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,451 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,486 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,496 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:49,534 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,539 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,545 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,556 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,573 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:49,573 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:49,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,598 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:49,598 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,615 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:49,616 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:49,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:49,643 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:51:49,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:49,645 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:49,661 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:49,661 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:31 [2019-02-25 15:51:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:49,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:49,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:49,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:49,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:49,723 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-25 15:51:49,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:49,964 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-25 15:51:49,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:51:49,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:49,966 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:51:49,966 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:51:49,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:51:49,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-25 15:51:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:51:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-25 15:51:49,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-25 15:51:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:49,973 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-25 15:51:49,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-25 15:51:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:49,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:49,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:49,974 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:49,975 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-25 15:51:49,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:49,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:49,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:49,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:50,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:50,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:50,059 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:50,059 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-25 15:51:50,061 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:50,062 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:50,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:50,675 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:50,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:50,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:50,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:50,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:50,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:50,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:50,691 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:51:50,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:50,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:50,723 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,738 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,750 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,768 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:50,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:50,791 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:50,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:50,794 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,810 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,818 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,826 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,845 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:50,846 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:50,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,876 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:50,877 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:50,894 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:50,895 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:50,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:50,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:50,924 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:51,071 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:51,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:51:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:51,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:51,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:51,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:51,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:51,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:51,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:51,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:51,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:51,140 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-25 15:51:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:51,469 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-25 15:51:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:51:51,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:51,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:51,471 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:51:51,471 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:51:51,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:51:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:51:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-25 15:51:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:51:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-25 15:51:51,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-25 15:51:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:51,487 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-25 15:51:51,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-25 15:51:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:51,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:51,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:51,489 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:51,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-25 15:51:51,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:51,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:51,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:51,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:51,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:51,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:51,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:51,660 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:51,660 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-25 15:51:51,664 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:51,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:52,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:52,242 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:52,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:52,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:52,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:52,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:52,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:52,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:52,256 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:51:52,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:52,260 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:52,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,268 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:52,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:52,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,318 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:52,318 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,346 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,356 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,364 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:52,400 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,405 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,414 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,424 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,459 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:52,459 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:52,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,479 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:52,480 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,502 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:52,502 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:52,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:52,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:52,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:52,564 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:52,565 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:51:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:52,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:52,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:52,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:51:52,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:52,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:52,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:52,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:51:52,648 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-25 15:51:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:52,837 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-25 15:51:52,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:51:52,838 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:52,839 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:51:52,839 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:51:52,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:51:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:51:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-25 15:51:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:51:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-25 15:51:52,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-25 15:51:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:52,848 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-25 15:51:52,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-25 15:51:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:52,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:52,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:52,849 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-25 15:51:52,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:52,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:52,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:52,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:52,881 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:52,882 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-25 15:51:52,883 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:52,883 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:53,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:53,054 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:53,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:53,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:53,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:53,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:53,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:53,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:53,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:51:53,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:53,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:53,088 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,097 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,108 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:53,131 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:53,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:53,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:51:53,153 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,174 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,183 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,191 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,204 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:53,204 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-25 15:51:53,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,229 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:51:53,230 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:53,244 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-25 15:51:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:53,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:53,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:53,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:53,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:53,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:53,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:53,312 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-25 15:51:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:53,422 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-25 15:51:53,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:53,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:51:53,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:53,424 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:51:53,424 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:51:53,425 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-02-25 15:51:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:51:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-25 15:51:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:51:53,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-25 15:51:53,435 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-25 15:51:53,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:53,435 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-25 15:51:53,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-25 15:51:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:53,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:53,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:53,436 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-25 15:51:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:53,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:53,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:53,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:53,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:53,509 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-25 15:51:53,510 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:53,511 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:53,753 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:53,754 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:53,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:53,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:53,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:53,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:53,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:51:53,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:53,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:53,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:53,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,818 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:53,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,831 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:53,831 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,853 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,870 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,881 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:53,912 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,919 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,926 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,937 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:53,957 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:53,957 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:53,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:53,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:53,985 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,002 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:54,003 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:54,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:54,065 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,084 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:54,085 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:51:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:54,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:54,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:54,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:54,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:54,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:54,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:54,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:54,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:54,165 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-25 15:51:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:54,509 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-25 15:51:54,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:51:54,510 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:54,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:54,511 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:51:54,511 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:51:54,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:54,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:51:54,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-25 15:51:54,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:51:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-25 15:51:54,522 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-25 15:51:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:54,522 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-25 15:51:54,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-25 15:51:54,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:54,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:54,523 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:54,523 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-25 15:51:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:54,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:54,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:54,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:54,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:54,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:54,586 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:54,586 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-25 15:51:54,587 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:54,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:54,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:54,717 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:54,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:54,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:54,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:54,731 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:51:54,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:54,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:54,744 INFO L467 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 18 treesize of output 20 [2019-02-25 15:51:54,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,755 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:51:54,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:51:54,768 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,795 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,805 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,813 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:54,843 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,848 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,870 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:54,894 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-25 15:51:54,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:54,913 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-25 15:51:54,913 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:54,949 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:54,949 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-25 15:51:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:54,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:55,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:55,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:55,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:55,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:55,032 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-25 15:51:55,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:55,206 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-25 15:51:55,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:55,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:51:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:55,208 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:51:55,208 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:51:55,209 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-02-25 15:51:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:51:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-25 15:51:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:51:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-25 15:51:55,218 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-25 15:51:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:55,219 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-25 15:51:55,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-25 15:51:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:55,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:55,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:51:55,220 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-25 15:51:55,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:55,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:55,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:55,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:51:55,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:55,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:55,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:55,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:55,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:55,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:55,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:55,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:51:55,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:55,319 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:51:55,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:55,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:55,376 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,383 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,398 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,411 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:55,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:55,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:55,436 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:55,437 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,453 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,461 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,469 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,487 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:55,487 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:55,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,508 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:55,508 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,524 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:55,524 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:55,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:51:55,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,572 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:55,573 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-25 15:51:55,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:55,600 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:55,601 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:55,617 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:55,618 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:51:55,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:55,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:55,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:55,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:51:55,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:55,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:51:55,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:51:55,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:55,686 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-25 15:51:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:56,050 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-25 15:51:56,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:51:56,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:51:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:56,051 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:51:56,052 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:51:56,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:51:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:51:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-25 15:51:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:51:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-25 15:51:56,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-25 15:51:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:56,064 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-25 15:51:56,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:51:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-25 15:51:56,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:56,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:56,065 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:51:56,065 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-25 15:51:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:56,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:51:56,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:56,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:51:56,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:51:56,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:56,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:51:56,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:51:56,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:51:56,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:51:56,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:51:56,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:56,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:56,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,218 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:56,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,224 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:56,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:56,240 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,257 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,268 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,277 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:56,315 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,321 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,327 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,338 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,358 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:56,358 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:56,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:56,389 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,407 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:56,407 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:56,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:51:56,442 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,459 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:56,460 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-25 15:51:56,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:56,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:56,501 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:56,519 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:56,519 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:51:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,542 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-25 15:51:56,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:56,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:51:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:51:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:51:56,617 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-25 15:51:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:57,007 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-25 15:51:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:51:57,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-25 15:51:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:57,009 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:51:57,009 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:51:57,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:51:57,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-25 15:51:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:51:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-25 15:51:57,020 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-25 15:51:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:57,020 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-25 15:51:57,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:51:57,021 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-25 15:51:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:57,021 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:57,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:51:57,022 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-25 15:51:57,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:51:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:57,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:57,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:57,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:57,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:57,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:51:57,118 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-25 15:51:57,120 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:57,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:57,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:57,697 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:57,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:57,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:57,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:57,733 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:51:57,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:57,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:51:57,764 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,776 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,784 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,795 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:57,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:51:57,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:57,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:51:57,842 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,860 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,869 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,876 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,895 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:57,895 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:51:57,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:57,920 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:57,941 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:51:57,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:57,967 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:51:57,968 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:57,986 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:57,987 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:51:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:58,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:58,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:58,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:58,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:58,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:58,052 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-25 15:51:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:58,605 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-25 15:51:58,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:51:58,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:51:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:58,607 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:51:58,607 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:51:58,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:51:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:51:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-25 15:51:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:51:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-25 15:51:58,624 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-25 15:51:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:58,624 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-25 15:51:58,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-25 15:51:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:58,625 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:58,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:51:58,626 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-25 15:51:58,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:58,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:58,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:58,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:58,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:58,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:58,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:58,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:51:58,834 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-25 15:51:58,836 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:58,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:59,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:59,482 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:51:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:59,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:59,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:59,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:59,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:59,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:59,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:59,505 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:51:59,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,512 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:51:59,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:51:59,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:51:59,528 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,547 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,559 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,573 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,598 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:51:59,598 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,603 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,609 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,622 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:59,623 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-25 15:51:59,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:51:59,690 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:51:59,768 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2019-02-25 15:51:59,768 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:124 [2019-02-25 15:51:59,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,846 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:51:59,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2019-02-25 15:51:59,846 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,904 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:51:59,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-02-25 15:51:59,905 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2019-02-25 15:51:59,947 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,980 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-25 15:51:59,981 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:65 [2019-02-25 15:52:00,383 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-02-25 15:52:00,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,459 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:00,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-02-25 15:52:00,460 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,508 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2019-02-25 15:52:00,508 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2019-02-25 15:52:00,549 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:00,583 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-02-25 15:52:00,583 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-25 15:52:00,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-02-25 15:52:00,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:00,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:00,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-25 15:52:00,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:00,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:00,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:00,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:00,657 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-25 15:52:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:01,608 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-25 15:52:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:52:01,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:01,610 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:52:01,610 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:52:01,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:52:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-25 15:52:01,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:52:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-25 15:52:01,625 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-25 15:52:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:01,625 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-25 15:52:01,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-25 15:52:01,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:01,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:01,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:01,626 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:01,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-25 15:52:01,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:01,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:01,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:01,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:01,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:01,708 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-25 15:52:01,709 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:01,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:02,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:02,395 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:02,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:02,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:02,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:02,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:02,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:02,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:02,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:02,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,431 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:02,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:02,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,450 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:02,451 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,479 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,492 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,499 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:02,536 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,541 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,547 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,558 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,577 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,578 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:02,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,604 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:02,605 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,623 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:02,624 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:02,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,649 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:02,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:02,650 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:02,669 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:02,669 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:31 [2019-02-25 15:52:02,885 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-02-25 15:52:02,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:02,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:03,046 INFO L292 Elim1Store]: Index analysis took 158 ms [2019-02-25 15:52:03,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:52:03,047 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:03,315 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:03,315 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:03,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:04,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:04,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:04,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:04,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:04,227 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-25 15:52:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:04,682 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-25 15:52:04,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:04,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:04,684 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:52:04,684 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:52:04,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:52:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-25 15:52:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:52:04,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-25 15:52:04,701 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-25 15:52:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:04,701 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-25 15:52:04,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-25 15:52:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:04,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:04,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:04,703 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-25 15:52:04,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:04,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:04,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:04,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:04,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:04,774 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-25 15:52:04,775 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:04,776 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:05,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:05,276 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:05,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:05,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:05,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:05,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:05,336 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,351 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,368 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:05,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-25 15:52:05,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:52:05,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:52:05,396 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,409 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,416 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,424 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,439 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,439 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-25 15:52:05,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:05,467 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,475 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,476 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:05,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:05,494 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:05,507 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-25 15:52:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,520 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:05,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:05,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:05,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:05,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:05,570 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-25 15:52:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:05,904 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-25 15:52:05,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:05,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:05,906 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:52:05,906 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:52:05,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:52:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-25 15:52:05,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:52:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-25 15:52:05,924 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-25 15:52:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:05,924 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-25 15:52:05,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:05,925 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-25 15:52:05,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:05,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:05,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:05,927 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,927 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-25 15:52:05,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:06,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:06,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:52:06,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:06,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:06,006 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-25 15:52:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:06,097 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-25 15:52:06,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:06,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:52:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:06,098 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:52:06,098 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:52:06,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:52:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:52:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-25 15:52:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:52:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-25 15:52:06,112 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-25 15:52:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:06,113 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-25 15:52:06,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-25 15:52:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:06,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:06,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:06,114 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-25 15:52:06,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:06,351 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-02-25 15:52:06,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:06,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:06,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:06,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:06,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:06,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:06,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:06,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:06,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:06,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:06,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:06,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:06,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:06,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,441 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:06,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,446 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:06,446 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,464 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,474 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,483 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:06,520 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,551 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,557 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,567 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,584 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,585 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:06,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,625 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:06,625 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,642 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,642 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:06,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:06,666 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,683 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,684 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:06,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,708 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:06,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:06,710 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,725 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:06,726 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:06,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-02-25 15:52:06,743 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:06,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:06,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:06,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:06,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:06,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:06,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:06,791 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-25 15:52:07,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:07,255 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-25 15:52:07,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:07,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:07,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:07,256 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:52:07,257 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:52:07,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:07,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:52:07,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-25 15:52:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:52:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-25 15:52:07,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-25 15:52:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:07,276 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-25 15:52:07,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-25 15:52:07,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:07,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:07,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:07,277 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:07,277 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-25 15:52:07,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:07,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:07,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:07,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:07,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:07,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:07,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:07,325 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-25 15:52:07,326 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:07,326 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:07,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:07,561 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:07,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:07,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:07,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:07,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:07,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:07,579 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:07,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:07,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:07,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:07,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:07,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:07,617 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,645 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,655 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,664 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:07,693 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,699 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,706 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,717 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,736 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,736 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:07,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:07,767 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,785 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:07,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:07,806 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,821 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:07,821 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:07,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:08,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:08,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:08,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:08,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:08,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:08,001 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-25 15:52:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:08,148 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-25 15:52:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:08,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:08,149 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:52:08,149 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:52:08,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-02-25 15:52:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:52:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-25 15:52:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:52:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-25 15:52:08,168 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-25 15:52:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:08,168 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-25 15:52:08,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-25 15:52:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:08,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:08,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:08,169 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:08,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,169 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-25 15:52:08,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:08,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:08,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:08,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:08,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:08,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:08,234 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-25 15:52:08,235 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:08,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:08,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:08,542 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:08,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:08,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:08,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:08,581 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:08,718 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:08,718 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,725 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,732 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,741 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:08,760 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:08,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:08,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:08,766 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,781 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,790 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,796 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,815 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:08,816 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:08,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:08,839 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:08,839 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,856 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:08,856 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:08,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:08,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:08,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:08,886 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:08,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:08,887 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,913 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:08,914 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:08,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,941 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:08,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:08,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:08,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:52:08,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:08,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:52:08,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:52:08,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:08,997 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-25 15:52:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:09,301 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-25 15:52:09,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:09,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:52:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:09,304 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:52:09,304 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:52:09,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:52:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-25 15:52:09,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:52:09,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-25 15:52:09,329 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-25 15:52:09,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:09,329 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-25 15:52:09,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:52:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-25 15:52:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:09,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:09,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:09,331 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:09,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-25 15:52:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:09,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:09,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:09,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:09,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:09,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:09,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:09,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:09,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:09,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:09,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:52:09,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:09,414 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:09,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:09,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:09,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:09,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:09,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:09,441 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,521 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,533 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,541 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:09,575 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,600 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,606 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,616 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,634 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,635 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:09,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,655 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:09,655 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,673 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,673 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:09,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:09,693 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,715 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:09,715 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:09,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-02-25 15:52:09,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:09,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:09,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:09,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:09,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:09,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:09,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:09,771 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-25 15:52:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:09,964 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-25 15:52:09,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:09,965 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:09,966 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:52:09,966 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:52:09,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:52:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-25 15:52:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:52:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-25 15:52:09,988 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-25 15:52:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:09,988 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-25 15:52:09,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-25 15:52:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:09,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:09,989 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:52:09,989 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:09,990 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-25 15:52:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:09,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:09,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:52:10,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:10,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:10,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:10,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:10,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:10,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:10,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:10,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:10,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:10,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:10,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:10,116 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,127 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,136 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,147 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:10,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:10,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:10,171 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:10,171 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,185 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,194 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,202 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,221 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,221 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:10,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:10,239 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,256 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,257 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:10,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,277 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:10,277 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,319 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,320 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-25 15:52:10,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,343 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:10,344 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,362 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,363 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:10,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,389 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:10,389 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,408 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:10,409 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-25 15:52:10,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-02-25 15:52:10,440 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:10,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:10,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-25 15:52:10,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:10,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:10,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:10,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:10,501 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-25 15:52:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:10,934 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-25 15:52:10,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:10,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:10,936 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:52:10,936 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:52:10,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:52:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-25 15:52:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:52:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-25 15:52:10,960 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-25 15:52:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:10,960 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-25 15:52:10,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-25 15:52:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:10,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:10,961 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:10,961 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:10,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-25 15:52:10,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:11,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:11,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:11,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:11,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:11,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:11,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:11,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:11,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:11,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:11,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:11,110 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:11,110 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,115 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,124 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,135 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,150 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:11,153 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:11,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:11,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:11,160 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,174 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,183 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,190 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,208 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,209 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:11,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:11,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,251 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,251 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:11,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:11,277 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,293 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,293 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-25 15:52:11,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:11,383 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,420 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,420 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:11,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,447 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:11,448 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:11,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-25 15:52:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:11,484 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:11,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:11,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:52:11,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:11,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:11,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:11,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:11,590 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-25 15:52:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:12,312 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-25 15:52:12,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:12,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:52:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:12,314 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:52:12,314 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:52:12,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:52:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-25 15:52:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:52:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-25 15:52:12,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-25 15:52:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:12,343 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-25 15:52:12,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-25 15:52:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:12,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:12,344 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:12,344 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:12,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:12,345 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-25 15:52:12,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:12,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:12,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:12,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:12,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:12,514 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:12,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:12,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:12,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:12,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:12,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:12,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:12,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:12,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:12,530 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:12,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:12,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:12,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:12,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:12,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:12,548 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,565 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,575 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,583 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:12,614 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,619 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,629 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,640 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:12,660 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:12,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:12,723 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,767 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:12,768 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:12,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:12,794 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,862 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:12,862 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:13,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:13,055 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,074 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:13,074 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-02-25 15:52:13,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:13,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:13,104 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,121 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:13,121 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-25 15:52:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:13,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:13,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:13,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:52:13,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:13,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:13,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:13,211 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-25 15:52:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:13,627 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-25 15:52:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:13,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:52:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:13,629 INFO L225 Difference]: With dead ends: 116 [2019-02-25 15:52:13,629 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:52:13,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:52:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-25 15:52:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:52:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-25 15:52:13,652 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-25 15:52:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:13,652 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-25 15:52:13,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:13,653 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-25 15:52:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:13,653 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:13,653 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:13,653 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:13,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-25 15:52:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:13,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:13,807 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:52:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:13,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:13,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:13,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:13,962 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-25 15:52:13,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:13,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:14,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:14,438 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:14,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:14,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:14,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:14,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:14,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:14,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:14,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:14,456 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:14,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:14,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,476 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:14,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,489 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:14,489 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,515 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,528 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,535 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:14,563 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,569 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,576 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,587 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,604 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:14,605 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:14,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:14,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,658 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:14,659 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:14,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:14,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,725 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:14,725 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:14,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:14,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:14,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:14,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:14,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:14,784 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-25 15:52:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:15,105 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-25 15:52:15,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:15,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:15,107 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:52:15,107 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:52:15,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:15,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:52:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-25 15:52:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:52:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-25 15:52:15,131 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-25 15:52:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:15,131 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-25 15:52:15,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-25 15:52:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:15,132 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:15,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:15,132 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:15,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-25 15:52:15,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:15,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:15,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:15,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:15,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:15,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:15,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:15,196 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-25 15:52:15,197 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:15,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:15,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:15,781 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:15,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:15,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:15,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:15,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:15,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:15,795 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:15,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:15,799 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:15,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:15,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:15,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,825 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:15,825 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,854 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,869 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,877 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:15,906 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,911 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,920 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,929 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,951 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:15,951 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:15,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:15,974 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,991 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:15,991 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:16,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,016 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:16,017 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,035 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:16,036 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:16,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,064 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:16,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:16,066 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,085 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:16,086 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:16,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:16,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:16,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:16,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:16,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:16,153 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-25 15:52:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:16,574 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-25 15:52:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:16,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:16,576 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:52:16,577 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:52:16,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:52:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-25 15:52:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:52:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-25 15:52:16,607 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-25 15:52:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:16,607 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-25 15:52:16,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-25 15:52:16,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:16,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:16,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:16,608 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:16,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:16,608 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-25 15:52:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:16,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:16,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:16,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:16,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:16,757 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:52:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:16,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:16,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:16,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:16,785 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-25 15:52:16,786 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:16,786 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:17,322 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:17,322 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:17,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:17,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:17,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:17,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:17,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:17,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:17,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:17,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:17,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:17,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:17,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:17,437 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,459 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,485 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,495 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:17,524 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,529 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,535 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,545 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,561 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,562 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:17,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:17,586 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,603 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,603 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:17,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:17,628 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,643 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,643 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:17,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,669 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:17,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:17,670 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,685 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:17,685 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:17,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:17,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:17,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:17,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:17,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:17,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:17,759 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-25 15:52:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:18,093 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-25 15:52:18,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:18,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:18,095 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:52:18,095 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:52:18,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:52:18,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-25 15:52:18,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:52:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-25 15:52:18,126 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-25 15:52:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:18,126 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-25 15:52:18,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:18,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-25 15:52:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:18,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:18,127 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:18,127 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-25 15:52:18,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:18,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:18,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:18,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:18,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:18,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:18,215 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-25 15:52:18,216 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:18,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:18,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:18,794 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:18,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:18,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:18,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:18,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:18,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:18,841 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,855 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,868 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,881 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:18,898 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:18,901 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:18,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:18,904 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,918 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,927 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,935 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,953 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:18,954 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:18,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:18,976 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,993 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:18,993 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:19,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,021 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:19,022 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,037 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:19,037 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:19,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:19,064 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:19,082 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-25 15:52:19,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:19,127 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:19,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:19,128 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:19,168 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:19,169 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:19,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:19,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:52:19,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:19,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:19,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:19,337 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-25 15:52:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:19,819 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-25 15:52:19,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:19,820 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:52:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:19,821 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:52:19,821 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:52:19,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:52:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-25 15:52:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:52:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-25 15:52:19,856 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-25 15:52:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:19,856 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-25 15:52:19,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-25 15:52:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:19,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:19,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:19,857 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:19,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:19,857 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-25 15:52:19,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:19,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:19,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:19,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:19,968 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:19,968 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-25 15:52:19,969 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:19,969 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:20,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:20,155 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:20,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:20,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:20,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:20,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:20,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:20,172 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:20,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:20,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:20,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,181 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:20,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:20,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,205 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:20,205 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,278 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,289 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,298 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,327 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:20,327 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,334 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,343 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,354 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,372 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,372 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:20,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,394 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:20,394 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,410 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,411 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:20,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:20,433 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,448 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:20,449 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:20,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:20,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:52:20,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:20,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:20,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:20,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:20,504 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-25 15:52:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:21,308 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-25 15:52:21,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:21,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:52:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:21,310 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:52:21,310 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:52:21,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:52:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-25 15:52:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-25 15:52:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-25 15:52:21,353 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-25 15:52:21,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:21,354 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-25 15:52:21,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-25 15:52:21,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:21,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:21,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:21,354 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:21,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:21,355 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-25 15:52:21,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:21,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:21,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:21,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:21,428 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:21,429 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-25 15:52:21,430 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:21,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:21,770 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:21,771 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:21,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:21,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:21,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:21,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:21,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:52:21,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:21,793 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:21,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:21,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:21,817 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:52:21,818 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,834 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,845 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,858 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:21,880 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,884 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,890 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,903 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,904 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-25 15:52:21,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:21,931 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,941 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,942 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:21,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,960 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:21,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:21,960 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:21,971 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:21,971 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-25 15:52:21,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:21,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:21,994 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:22,005 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-25 15:52:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:22,019 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:22,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:22,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:22,064 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-25 15:52:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:22,371 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-25 15:52:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:22,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:52:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:22,372 INFO L225 Difference]: With dead ends: 122 [2019-02-25 15:52:22,372 INFO L226 Difference]: Without dead ends: 121 [2019-02-25 15:52:22,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-25 15:52:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-25 15:52:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:52:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-25 15:52:22,423 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-25 15:52:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:22,424 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-25 15:52:22,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-25 15:52:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:22,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:22,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:22,425 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-25 15:52:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:22,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:22,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:22,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:22,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:22,473 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-25 15:52:22,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:22,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:22,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:22,912 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:22,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:22,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:22,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:22,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:22,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:22,929 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:22,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:22,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:22,953 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,965 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,984 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:23,005 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-25 15:52:23,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:52:23,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:52:23,012 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,026 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,034 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,043 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,060 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,060 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-25 15:52:23,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:23,090 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,100 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,100 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:23,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,119 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:23,120 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:23,120 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,131 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,131 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-25 15:52:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:23,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:23,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:23,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:23,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:23,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:23,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:23,189 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-25 15:52:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:23,414 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-25 15:52:23,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:23,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:23,416 INFO L225 Difference]: With dead ends: 113 [2019-02-25 15:52:23,416 INFO L226 Difference]: Without dead ends: 108 [2019-02-25 15:52:23,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-25 15:52:23,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-25 15:52:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:52:23,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-25 15:52:23,475 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-25 15:52:23,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:23,475 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-25 15:52:23,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-25 15:52:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:23,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:23,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:23,476 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:23,477 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-25 15:52:23,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:23,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:23,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:23,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:23,752 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-25 15:52:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:23,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:23,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:23,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:23,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:23,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:23,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:23,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:23,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:23,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:23,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:23,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:23,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:23,816 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:23,816 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,821 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,830 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,841 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,855 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:23,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:23,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:23,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:23,864 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,880 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,890 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,898 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,917 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,918 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:23,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,940 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:23,940 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,958 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,959 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:23,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:23,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:23,983 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:23,999 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:23,999 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:24,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,021 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:24,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:24,023 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:24,038 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:24,039 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:24,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:24,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:24,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:24,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:52:24,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:24,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:24,112 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-25 15:52:24,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:24,570 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-25 15:52:24,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:24,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:52:24,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:24,571 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:52:24,572 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:52:24,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:52:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-25 15:52:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:52:24,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-25 15:52:24,614 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-25 15:52:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:24,615 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-25 15:52:24,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-25 15:52:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:24,616 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:24,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:24,616 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-25 15:52:24,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:24,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:24,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:24,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:24,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:24,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:24,944 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:24,944 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-25 15:52:24,945 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:24,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:25,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:25,549 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:25,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:25,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:25,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:25,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:25,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:25,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:25,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:52:25,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:25,578 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:52:25,578 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,589 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:25,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-25 15:52:25,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-25 15:52:25,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:52:25,628 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,665 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,673 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,679 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,692 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:25,692 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-25 15:52:25,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:25,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:25,716 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,721 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,722 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:52:25,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:25,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:25,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:25,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:25,738 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:25,745 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:25,746 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-25 15:52:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:25,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:25,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:25,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:25,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:25,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:25,795 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-25 15:52:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:26,007 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-25 15:52:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:26,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:52:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:26,010 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:52:26,010 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:52:26,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-02-25 15:52:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:52:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-25 15:52:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-25 15:52:26,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-25 15:52:26,058 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-25 15:52:26,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:26,058 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-25 15:52:26,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-25 15:52:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:26,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:26,059 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:52:26,059 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-25 15:52:26,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:26,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:26,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:26,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:26,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:26,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:26,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:26,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:26,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:26,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:26,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:26,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:26,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:26,713 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:26,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:26,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:26,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,749 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:26,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,754 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:26,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,761 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:26,761 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,778 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,788 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,797 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:26,829 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,835 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,843 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,852 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:26,871 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:26,871 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:26,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:26,933 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:26,933 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,007 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:27,008 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:27,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,031 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:27,032 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,050 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:27,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:27,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,068 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,074 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:27,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:27,075 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:27,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:27,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:27,119 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-02-25 15:52:27,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:27,136 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:27,137 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-25 15:52:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:27,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:52:27,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:27,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:27,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:27,259 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-25 15:52:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:27,697 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-25 15:52:27,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:27,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:52:27,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:27,699 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:52:27,700 INFO L226 Difference]: Without dead ends: 116 [2019-02-25 15:52:27,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:27,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-25 15:52:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-25 15:52:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:52:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-25 15:52:27,751 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-25 15:52:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:27,751 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-25 15:52:27,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-25 15:52:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:27,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:27,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:27,752 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-25 15:52:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:27,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:27,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:27,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:52:27,832 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-25 15:52:27,833 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:27,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:28,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:28,517 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:52:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:28,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:28,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:28,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:28,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:28,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,529 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:28,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:28,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:28,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:28,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,552 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:28,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,566 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:28,566 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,594 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,603 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,612 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:28,641 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,647 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,653 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,663 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,680 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,681 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:28,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:28,704 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,721 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,721 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:28,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:28,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,762 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,763 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:28,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,784 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:28,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:28,786 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,801 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,801 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:28,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,828 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:28,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:52:28,829 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,844 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:28,845 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:52:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,861 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:52:28,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:28,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:52:28,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:52:28,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:28,921 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-25 15:52:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:29,502 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-25 15:52:29,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:29,503 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:52:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:29,504 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:52:29,505 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:52:29,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:52:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:52:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-25 15:52:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:52:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-25 15:52:29,563 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-25 15:52:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:29,563 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-25 15:52:29,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:52:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-25 15:52:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:29,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:29,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:29,564 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-25 15:52:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:29,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:29,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:29,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:29,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:29,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:29,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:29,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:29,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:29,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:29,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:29,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:29,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:29,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,742 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:29,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:29,758 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,774 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,784 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,792 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,820 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:29,821 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,827 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,835 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,845 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,863 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,863 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:29,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:29,891 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,907 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:29,907 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:29,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,934 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:29,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:29,935 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,951 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:29,951 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:29,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:29,976 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,994 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:29,995 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-25 15:52:30,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,046 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:30,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:30,047 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:30,065 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-25 15:52:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:30,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:30,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:30,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:52:30,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:30,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:52:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:52:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:30,160 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-25 15:52:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:30,791 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-25 15:52:30,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:30,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:52:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:30,794 INFO L225 Difference]: With dead ends: 172 [2019-02-25 15:52:30,794 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:52:30,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:52:30,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-25 15:52:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-25 15:52:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-25 15:52:30,846 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-25 15:52:30,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:30,846 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-25 15:52:30,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:52:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-25 15:52:30,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:52:30,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:30,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:52:30,847 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:30,847 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-25 15:52:30,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:30,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:30,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:30,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:31,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:31,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:31,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:31,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:31,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:31,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:31,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:31,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:31,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:31,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:31,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:31,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:31,073 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,084 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,092 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,103 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:31,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:31,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:31,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:31,128 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,142 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,165 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,171 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,189 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:31,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,217 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:31,218 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,234 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,234 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:31,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,258 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:31,259 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,275 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,275 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:31,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:31,302 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,320 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,320 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-25 15:52:31,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,348 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:31,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:31,350 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,366 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,366 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-25 15:52:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:31,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:52:31,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:31,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:52:31,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:52:31,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:31,458 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-25 15:52:31,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:31,904 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-25 15:52:31,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:31,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:52:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:31,907 INFO L225 Difference]: With dead ends: 140 [2019-02-25 15:52:31,907 INFO L226 Difference]: Without dead ends: 135 [2019-02-25 15:52:31,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:52:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-25 15:52:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-25 15:52:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:52:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-25 15:52:31,958 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-25 15:52:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:31,958 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-25 15:52:31,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:52:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-25 15:52:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:31,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:31,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:31,959 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:31,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-25 15:52:31,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:31,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:31,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:31,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:32,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:32,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:32,097 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-25 15:52:32,098 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:32,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:32,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:32,682 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:32,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:32,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:32,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:32,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,696 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:32,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:32,700 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:32,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:32,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:32,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:32,732 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,760 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,769 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,777 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:32,805 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,810 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,815 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,825 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,841 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,841 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:32,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:32,867 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,882 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:32,883 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:32,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:32,911 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,930 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:32,930 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:32,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,957 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:32,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:32,958 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,974 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:32,974 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:33,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:33,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:33,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:33,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:33,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:33,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:33,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:33,059 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-25 15:52:33,441 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-02-25 15:52:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:33,579 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-25 15:52:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:33,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:52:33,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:33,581 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:52:33,581 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:52:33,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:52:33,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-25 15:52:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-25 15:52:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-25 15:52:33,635 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-25 15:52:33,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:33,635 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-25 15:52:33,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:33,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-25 15:52:33,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:33,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:33,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:33,636 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:33,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-25 15:52:33,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:33,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:33,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:33,754 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:33,754 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-25 15:52:33,755 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:33,756 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:34,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:34,620 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:52:34,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:34,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:34,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,645 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:34,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:34,661 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:34,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:34,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:34,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,702 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:34,703 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,729 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,741 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,751 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,790 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:34,790 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,800 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,811 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,826 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,847 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,848 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:34,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,872 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:34,872 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,889 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,890 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:34,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:34,971 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,988 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,988 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:35,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,011 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:35,012 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:35,013 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,030 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,031 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:35,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,060 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:35,061 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:35,061 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,079 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,080 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-25 15:52:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:35,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:52:35,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:35,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:52:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:52:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:35,168 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-25 15:52:35,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:35,723 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-25 15:52:35,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:35,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:52:35,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:35,725 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:52:35,725 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:52:35,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:52:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:52:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-25 15:52:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:52:35,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-25 15:52:35,779 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-25 15:52:35,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:35,780 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-25 15:52:35,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:52:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-25 15:52:35,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:35,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:35,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:35,780 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:35,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-25 15:52:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:35,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:35,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:35,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:35,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:35,870 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-25 15:52:35,870 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:35,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:36,543 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:36,543 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:36,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:36,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:52:36,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:36,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:36,650 INFO L467 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 18 treesize of output 20 [2019-02-25 15:52:36,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-25 15:52:36,879 INFO L292 Elim1Store]: Index analysis took 142 ms [2019-02-25 15:52:36,879 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-25 15:52:36,880 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,965 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,972 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,980 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:36,987 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-25 15:52:37,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,012 INFO L467 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:37,013 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:37,023 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:52:37,023 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-02-25 15:52:37,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-25 15:52:37,042 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,052 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:37,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:52:37,053 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:37,062 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2019-02-25 15:52:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:37,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-25 15:52:37,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:37,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:52:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:52:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:37,110 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-25 15:52:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:37,326 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-25 15:52:37,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:37,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-25 15:52:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:37,328 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:52:37,328 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:52:37,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:37,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:52:37,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-25 15:52:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:52:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-25 15:52:37,434 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-25 15:52:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:37,434 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-25 15:52:37,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:52:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-25 15:52:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:37,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:37,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:37,435 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-25 15:52:37,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:37,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:37,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:37,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:37,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:37,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:37,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:37,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:37,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:37,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:37,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:37,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:37,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:37,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:37,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:37,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:37,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,645 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:37,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:37,652 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,669 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,678 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,687 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:37,715 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,721 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,730 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,740 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,757 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,758 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:37,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:37,787 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,802 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,802 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:37,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,830 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:37,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:37,831 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,849 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,849 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 [2019-02-25 15:52:37,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,884 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:52:37,885 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,903 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,903 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:37,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,929 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:37,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:52:37,930 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,947 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,947 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:52:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,966 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:38,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:38,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:52:38,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:38,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:38,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:38,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:38,032 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-25 15:52:38,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:38,651 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-25 15:52:38,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:38,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:52:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:38,653 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:52:38,653 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:52:38,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:52:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-25 15:52:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:52:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-25 15:52:38,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-25 15:52:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:38,749 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-25 15:52:38,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:38,749 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-25 15:52:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:38,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:38,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:38,750 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-25 15:52:38,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:38,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,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-02-25 15:52:38,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:38,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:38,816 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-25 15:52:38,817 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:38,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:39,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:39,395 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:39,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:39,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:39,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:39,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:39,411 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:39,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:39,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:39,419 INFO L467 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 18 treesize of output 20 [2019-02-25 15:52:39,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:52:39,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,445 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:52:39,446 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,469 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,481 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,492 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,515 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:39,515 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,520 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,529 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,545 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,545 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-25 15:52:39,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:39,575 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,593 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,594 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:39,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,638 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:39,639 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,652 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,652 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-25 15:52:39,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,693 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:39,694 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:39,694 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,711 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,711 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-25 15:52:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:39,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:39,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:39,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:39,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:39,855 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-25 15:52:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,292 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-25 15:52:40,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:40,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:52:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,293 INFO L225 Difference]: With dead ends: 68 [2019-02-25 15:52:40,293 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:52:40,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:52:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-25 15:52:40,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:52:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-25 15:52:40,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-25 15:52:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,457 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-25 15:52:40,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-25 15:52:40,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:40,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,458 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:52:40,459 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-25 15:52:40,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:52:40,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:40,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:52:40,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:40,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:40,674 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-25 15:52:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,811 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-25 15:52:40,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:40,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-25 15:52:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,812 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:52:40,813 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:52:40,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:52:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-25 15:52:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:52:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-25 15:52:40,974 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-25 15:52:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,975 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-25 15:52:40,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-25 15:52:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:40,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:40,976 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-25 15:52:40,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,134 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:52:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:41,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:41,215 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:41,215 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-25 15:52:41,216 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:41,216 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:41,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:41,809 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:41,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:41,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:41,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:41,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:41,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:41,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:41,850 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,867 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,884 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,897 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:41,916 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:41,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:41,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:41,922 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,936 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,945 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,953 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,970 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,971 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:41,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,993 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:41,994 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,029 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,029 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:42,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,053 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:42,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:42,054 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,071 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:52:42,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,095 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:42,095 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,112 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,113 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-25 15:52:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:42,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:42,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:42,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:42,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:42,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:42,173 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-25 15:52:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:42,585 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-25 15:52:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:52:42,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:52:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:42,587 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:52:42,587 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:52:42,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:52:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-25 15:52:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:52:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-25 15:52:42,698 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-25 15:52:42,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:42,698 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-25 15:52:42,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-25 15:52:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:42,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:42,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:42,699 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:42,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-25 15:52:42,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:42,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:42,860 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:42,861 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-25 15:52:42,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:42,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:43,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:43,044 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:43,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:43,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:43,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:43,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:43,058 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:43,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:43,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:43,077 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,093 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,104 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,127 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:43,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:43,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:43,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:43,151 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,165 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,173 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,181 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,199 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:43,199 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:43,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,222 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:43,222 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,238 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:43,239 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:43,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:43,264 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,281 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:43,281 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,301 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:43,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:43,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:43,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:43,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:43,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:43,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:43,337 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-25 15:52:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:43,743 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-25 15:52:43,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:43,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:52:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:43,744 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:52:43,745 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:52:43,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:52:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-25 15:52:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:52:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-25 15:52:43,849 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-25 15:52:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:43,849 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-25 15:52:43,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-25 15:52:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:43,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:43,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:43,850 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:43,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-25 15:52:43,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:43,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:43,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:43,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:43,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:43,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:43,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:43,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:43,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:43,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:43,943 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:43,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:43,961 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:43,961 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,970 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,983 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:44,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-25 15:52:44,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:52:44,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:52:44,011 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,034 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,041 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,048 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,066 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-25 15:52:44,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,110 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:44,110 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,120 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,120 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-25 15:52:44,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:44,165 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,176 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,176 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-25 15:52:44,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,195 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:44,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:52:44,196 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,207 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,207 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-25 15:52:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:44,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:44,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:44,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:44,291 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-25 15:52:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:44,769 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-25 15:52:44,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:44,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:52:44,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:44,770 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:52:44,770 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:52:44,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:52:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-25 15:52:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:52:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-25 15:52:44,899 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-25 15:52:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:44,899 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-25 15:52:44,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-25 15:52:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:52:44,900 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:44,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:44,900 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-25 15:52:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:45,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:45,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:45,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:52:45,064 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-25 15:52:45,064 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:45,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:45,294 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:45,294 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:45,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:45,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:45,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:45,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:45,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:45,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:52:45,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:45,323 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:52:45,323 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,338 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:45,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-25 15:52:45,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-25 15:52:45,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:52:45,378 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,388 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,396 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,403 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,416 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:45,416 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-25 15:52:45,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:45,450 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:45,475 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:45,475 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:36 [2019-02-25 15:52:45,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,516 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:45,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:45,516 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:52:45,540 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,558 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:45,559 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-25 15:52:45,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:45,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:45,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:45,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-25 15:52:45,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:45,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:45,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:45,621 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-25 15:52:46,062 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-25 15:52:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:46,580 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-25 15:52:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:46,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:52:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:46,581 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:52:46,581 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:52:46,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:52:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:52:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-25 15:52:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:52:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-25 15:52:46,779 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-25 15:52:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:46,780 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-25 15:52:46,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:46,780 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-25 15:52:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:52:46,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:46,780 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:46,780 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:46,780 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-25 15:52:46,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:46,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:46,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:46,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:47,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:47,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:47,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:52:47,046 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-25 15:52:47,047 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:47,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:47,508 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:47,508 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:47,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:47,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:47,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:47,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:47,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:47,524 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:47,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:47,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:47,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:47,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:47,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:47,555 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,586 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,597 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,606 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:47,634 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,640 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,646 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,656 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,675 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:47,675 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:47,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,695 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:47,695 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,713 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:47,713 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:47,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:47,748 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,764 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:47,764 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:47,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,790 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:47,790 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,808 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:47,809 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:47,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:47,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:47,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:52:47,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:47,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:52:47,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:52:47,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:47,879 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-25 15:52:48,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:48,579 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-25 15:52:48,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:52:48,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-25 15:52:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:48,580 INFO L225 Difference]: With dead ends: 118 [2019-02-25 15:52:48,580 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:52:48,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:48,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:52:48,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-25 15:52:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:52:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-25 15:52:48,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-25 15:52:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:48,790 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-25 15:52:48,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:52:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-25 15:52:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:52:48,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:48,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:48,791 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:48,791 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-25 15:52:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:48,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:48,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:52:48,900 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-25 15:52:48,900 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:48,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:49,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:49,574 INFO L272 AbstractInterpreter]: Visited 8 different actions 18 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:52:49,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:49,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:49,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:49,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:49,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:49,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:49,589 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:49,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:49,600 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:49,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 18 treesize of output 24 [2019-02-25 15:52:49,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:49,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,629 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:49,630 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,654 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,662 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,670 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:49,698 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,703 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,712 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,722 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,738 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,738 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:49,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:49,765 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,782 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,782 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:49,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,809 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:49,810 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,827 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,828 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:49,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,883 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:49,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:49,884 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,912 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:49,913 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:49,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,978 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:49,978 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:49,979 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:50,006 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:50,007 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-25 15:52:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:52:50,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:50,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:52:50,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:52:50,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:50,156 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-25 15:52:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:51,062 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-25 15:52:51,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:52:51,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-25 15:52:51,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:51,065 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:52:51,065 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:52:51,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:52:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:52:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-25 15:52:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:52:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-25 15:52:51,343 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-25 15:52:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:51,343 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-25 15:52:51,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:52:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-25 15:52:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:52:51,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:51,344 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:51,344 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:51,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-25 15:52:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:51,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:51,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:51,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:52:51,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:51,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:51,418 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-25 15:52:51,418 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-25 15:52:51,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:51,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:51,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:51,632 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:51,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:51,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:51,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:51,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:51,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:52:51,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:51,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:51,653 INFO L467 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 18 treesize of output 20 [2019-02-25 15:52:51,661 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-25 15:52:51,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-25 15:52:51,726 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,739 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,747 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,756 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,773 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:52:51,773 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,779 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,792 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:51,792 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-25 15:52:51,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:52:51,828 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:51,854 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-25 15:52:51,854 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-25 15:52:51,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,881 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:51,881 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:52:51,908 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,924 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:51,924 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-25 15:52:51,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:52:51,951 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:52:51,976 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,993 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:51,993 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-25 15:52:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:52,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:52,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:52,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:52:52,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:52,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:52:52,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:52:52,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:52,073 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-25 15:52:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:52,734 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-25 15:52:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:52,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-25 15:52:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:52,736 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:52:52,736 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:52:52,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:52:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-25 15:52:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:52:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-25 15:52:53,049 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-25 15:52:53,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:53,049 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-25 15:52:53,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:52:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-25 15:52:53,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:52:53,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:53,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:53,051 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:53,051 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-25 15:52:53,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:53,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:53,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:53,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:53,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:53,204 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:52:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:52:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:53,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:53,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:53,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:53,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:53,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:53,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:53,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:53,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:53,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:53,306 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:53,309 INFO L467 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 18 treesize of output 20 [2019-02-25 15:52:53,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-25 15:52:53,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,319 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-25 15:52:53,319 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,336 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,344 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,351 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:52:53,376 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,382 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,391 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,407 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,407 INFO L208 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-25 15:52:53,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:53,444 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:53,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:53,496 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:62 [2019-02-25 15:52:53,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,573 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:52:53,574 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,613 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:53,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:52:53,614 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,639 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:53,639 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-02-25 15:52:53,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,690 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:53,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:53,691 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-02-25 15:52:53,750 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,775 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:53,776 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-25 15:52:53,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2019-02-25 15:52:53,816 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:53,857 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:53,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:52:53,858 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:53,886 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:53,887 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-02-25 15:52:53,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:53,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:53,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:53,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:52:53,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:53,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:52:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:52:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:53,992 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-25 15:52:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:55,310 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-25 15:52:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:52:55,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-25 15:52:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:55,312 INFO L225 Difference]: With dead ends: 186 [2019-02-25 15:52:55,312 INFO L226 Difference]: Without dead ends: 177 [2019-02-25 15:52:55,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:52:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-25 15:52:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-25 15:52:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:52:55,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-25 15:52:55,720 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-25 15:52:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:55,720 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-25 15:52:55,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:52:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-25 15:52:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:52:55,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:55,721 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:55,721 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:55,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-25 15:52:55,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:55,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:55,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:52:55,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:55,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:55,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:52:55,842 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-25 15:52:55,842 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:55,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:56,430 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:56,430 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:56,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:56,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:56,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:56,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:56,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:56,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:56,444 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:52:56,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:56,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:56,471 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,485 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,493 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,510 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:56,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:56,531 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:56,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:56,535 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,549 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,559 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,567 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,586 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,586 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:56,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:56,611 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,628 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,628 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:56,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:56,651 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,667 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,667 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-25 15:52:56,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,692 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:56,692 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:56,693 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,709 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,710 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:56,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:56,778 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:56,778 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:56,797 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:56,797 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-25 15:52:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:56,817 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:56,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:56,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:56,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:52:56,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:56,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:52:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:52:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:56,877 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-25 15:52:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:57,652 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-25 15:52:57,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:57,656 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-25 15:52:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:57,657 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:52:57,657 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:52:57,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:52:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:52:57,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-25 15:52:57,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:52:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-25 15:52:57,766 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-25 15:52:57,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:57,766 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-25 15:52:57,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:52:57,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-25 15:52:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:52:57,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:57,767 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:52:57,767 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:57,768 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-25 15:52:57,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:57,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:57,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:57,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:57,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:57,938 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:52:58,186 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:52:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-25 15:52:58,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:58,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:58,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:58,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:58,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:58,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:58,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:52:58,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:52:58,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:52:58,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:58,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:58,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:58,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:58,267 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,274 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,282 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,293 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-25 15:52:58,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-25 15:52:58,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-25 15:52:58,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-25 15:52:58,315 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,328 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,337 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,345 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,363 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,364 INFO L208 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-25 15:52:58,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:58,393 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,411 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,411 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:52:58,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:52:58,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,458 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,458 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-02-25 15:52:58,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,486 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:58,487 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:58,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,503 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,504 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-25 15:52:58,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,527 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:58,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:52:58,529 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,567 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,567 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:31 [2019-02-25 15:52:58,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:58,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 47 [2019-02-25 15:52:58,597 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:58,615 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:58,615 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-25 15:52:58,638 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:58,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:58,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 15:52:58,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:58,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:52:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:52:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:52:58,737 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-25 15:52:59,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:59,225 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-25 15:52:59,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:59,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-25 15:52:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:59,226 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:52:59,226 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:52:59,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:52:59,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:52:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:52:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:52:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:52:59,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-25 15:52:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:59,228 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:52:59,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:52:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:52:59,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:52:59,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:52:59,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:52:59,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:00,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:02,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:05,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:05,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:05,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:05,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:05,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:11,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:11,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-25 15:53:13,922 WARN L181 SmtUtils]: Spent 14.68 s on a formula simplification. DAG size of input: 1516 DAG size of output: 1077 [2019-02-25 15:53:31,105 WARN L181 SmtUtils]: Spent 17.17 s on a formula simplification. DAG size of input: 1009 DAG size of output: 75 [2019-02-25 15:53:31,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:53:31,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-25 15:53:31,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse12 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse19 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse2 1))) (.cse6 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse11 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse6 1))) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse7 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4))) (.cse8 (= 0 (select .cse19 ULTIMATE.start_main_p1))) (.cse5 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse9 (= 0 (select .cse19 ULTIMATE.start_main_p2))) (.cse14 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse12 (- 1))))) (let ((.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse1 (= .cse12 0)) (.cse18 (and .cse0 .cse7 .cse4 .cse8 .cse5 .cse9 (<= 1 (select .cse14 ULTIMATE.start_main_p3)))) (.cse10 (<= (+ (select .cse11 ULTIMATE.start_main_p4) 1) 0))) (or (and .cse0 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) .cse1 (<= (select |#memory_int| ULTIMATE.start_main_p2) 0) (= .cse2 0) .cse3 .cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse5 (<= 0 .cse6)) (and (and (and .cse7 .cse8 .cse9 .cse3) .cse10) (= 0 (select .cse11 ULTIMATE.start_main_p3))) (and .cse4 (<= .cse12 0) (let ((.cse17 (select .cse14 ULTIMATE.start_main_p1))) (let ((.cse15 (and .cse7 (<= 1 .cse17) .cse0)) (.cse13 (<= 0 .cse2))) (or (and .cse13 (= 0 (select .cse14 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) .cse15) (let ((.cse16 (<= (+ (select .cse11 ULTIMATE.start_main_p2) 1) 0))) (or (and (and .cse13 .cse15) .cse16) (and .cse13 .cse16 (= 0 .cse17) .cse3))))))) (and .cse18 .cse1) (and .cse18 .cse10)))))) [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-25 15:53:31,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-25 15:53:31,111 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-25 15:53:31,129 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:53:31 BoogieIcfgContainer [2019-02-25 15:53:31,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:53:31,130 INFO L168 Benchmark]: Toolchain (without parser) took 113352.03 ms. Allocated memory was 131.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 106.3 MB in the beginning and 197.9 MB in the end (delta: -91.6 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-02-25 15:53:31,131 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:53:31,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 131.1 MB. Free memory was 106.3 MB in the beginning and 103.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:53:31,131 INFO L168 Benchmark]: Boogie Preprocessor took 19.81 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 102.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:53:31,132 INFO L168 Benchmark]: RCFGBuilder took 304.67 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 92.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:53:31,132 INFO L168 Benchmark]: TraceAbstraction took 112967.27 ms. Allocated memory was 131.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 92.2 MB in the beginning and 197.9 MB in the end (delta: -105.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-02-25 15:53:31,134 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.21 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.12 ms. Allocated memory is still 131.1 MB. Free memory was 106.3 MB in the beginning and 103.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.81 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 102.7 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 304.67 ms. Allocated memory is still 131.1 MB. Free memory was 102.7 MB in the beginning and 92.4 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 112967.27 ms. Allocated memory was 131.1 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 92.2 MB in the beginning and 197.9 MB in the end (delta: -105.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((((((((!(p1 == p4) && !(p2 == p1)) && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && #memory_int[p3] == 0) && !(p1 == p3)) && !(p3 == p4)) && !(p3 == p2)) && !(p2 == p4)) && 0 <= #memory_int[p1]) || (((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && !(p1 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p3])) || ((!(p3 == p4) && #memory_int[p4] <= 0) && ((((0 <= #memory_int[p3] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || ((0 <= #memory_int[p3] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || (((0 <= #memory_int[p3] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p4] == 0)) || (((((((!(p1 == p4) && !(p1 == p2)) && !(p3 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 112.8s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 31.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 21.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 367 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4047136906 FormulaSimplificationTreeSizeReduction, 14.6s HoareSimplificationTime, 1 FomulaSimplificationsInter, 57173215 FormulaSimplificationTreeSizeReductionInter, 17.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91527 SizeOfPredicates, 243 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 643 ConjunctsInUnsatCore, 157 InterpolantComputations, 7 PerfectInterpolantSequences, 155/871 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...