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-a9d37a5-m [2019-02-28 10:52:28,529 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:52:28,531 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:52:28,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:52:28,546 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:52:28,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:52:28,549 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:52:28,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:52:28,555 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:52:28,556 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:52:28,564 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:52:28,564 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:52:28,566 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:52:28,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:52:28,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:52:28,574 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:52:28,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:52:28,579 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:52:28,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:52:28,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:52:28,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:52:28,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:52:28,597 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:52:28,597 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:52:28,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:52:28,599 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:52:28,599 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:52:28,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:52:28,604 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:52:28,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:52:28,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:52:28,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:52:28,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:52:28,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:52:28,610 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:52:28,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:52:28,611 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-28 10:52:28,633 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:52:28,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:52:28,634 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:52:28,634 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:52:28,635 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:52:28,635 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:52:28,635 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:52:28,635 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:52:28,635 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:52:28,636 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:52:28,636 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:52:28,636 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:52:28,637 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:52:28,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:52:28,638 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:52:28,639 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:52:28,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:52:28,639 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:52:28,639 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:52:28,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:52:28,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:52:28,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:52:28,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:52:28,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:52:28,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:52:28,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:28,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:52:28,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:52:28,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:52:28,644 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:52:28,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:52:28,645 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:52:28,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:52:28,645 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:52:28,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:52:28,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:52:28,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:52:28,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:52:28,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:52:28,729 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-28 10:52:28,730 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-28 10:52:28,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:52:28,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:52:28,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:28,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:52:28,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:52:28,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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,810 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:52:28,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:52:28,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:52:28,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:52:28,853 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,853 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,854 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,856 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,861 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,866 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,868 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 28.02 10:52:28" (1/1) ... [2019-02-28 10:52:28,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:52:28,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:52:28,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:52:28,870 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:52:28,871 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 28.02 10:52:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:52:28,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:52:28,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:52:29,153 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:52:29,153 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-28 10:52:29,155 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:52:29 BoogieIcfgContainer [2019-02-28 10:52:29,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:52:29,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:52:29,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:52:29,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:52:29,160 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 28.02 10:52:28" (1/2) ... [2019-02-28 10:52:29,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0d0375 and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:52:29, skipping insertion in model container [2019-02-28 10:52:29,162 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 28.02 10:52:29" (2/2) ... [2019-02-28 10:52:29,164 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-28 10:52:29,174 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:52:29,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-28 10:52:29,200 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-28 10:52:29,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:52:29,235 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:52:29,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:52:29,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:52:29,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:52:29,235 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:52:29,236 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:52:29,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:52:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-28 10:52:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:52:29,259 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:29,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:52:29,263 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-28 10:52:29,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:29,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:29,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:29,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:29,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:52:29,497 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:29,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:29,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:29,514 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-28 10:52:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:29,761 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-28 10:52:29,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:29,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:52:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:29,777 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:52:29,778 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:52:29,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:52:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-28 10:52:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:52:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-28 10:52:29,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-28 10:52:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:29,821 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-28 10:52:29,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-28 10:52:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:29,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:29,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:29,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-28 10:52:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:29,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:29,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:30,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:30,089 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:30,091 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-28 10:52:30,155 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:30,155 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:33,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:33,656 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-28 10:52:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:33,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:33,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:33,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:33,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:33,714 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:52:33,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:33,788 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:33,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:33,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:33,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:33,900 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:33,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:33,925 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:33,968 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:33,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:34,016 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:34,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:34,067 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:34,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:34,071 INFO L289 Elim1Store]: Index analysis took 126 ms [2019-02-28 10:52:34,072 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:34,073 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,133 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,202 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,313 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,522 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:34,524 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,540 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,554 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,610 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,640 INFO L315 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-28 10:52:34,641 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:34,725 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:34,726 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:34,818 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:34,819 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:34,874 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:34,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:34,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:52:34,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:34,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:52:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:52:34,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:52:34,919 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-28 10:52:35,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:35,223 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-28 10:52:35,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:52:35,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:52:35,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:35,226 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:52:35,227 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:52:35,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:52:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:52:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-28 10:52:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:52:35,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-28 10:52:35,233 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-28 10:52:35,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:35,234 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-28 10:52:35,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:52:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-28 10:52:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:35,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:35,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:35,235 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:35,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-28 10:52:35,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:35,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:35,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:35,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:35,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:35,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:52:35,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:35,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:35,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:35,292 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-28 10:52:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:35,394 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-28 10:52:35,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:35,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:52:35,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:35,397 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:52:35,398 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:52:35,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:35,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:52:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-28 10:52:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:52:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-28 10:52:35,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-28 10:52:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:35,405 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-28 10:52:35,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-28 10:52:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:35,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:35,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:35,407 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:35,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:35,408 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-28 10:52:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:35,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:35,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:35,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:35,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:35,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:35,582 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:35,583 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-28 10:52:35,586 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:35,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:35,911 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:35,911 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-28 10:52:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:35,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:35,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:35,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:35,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:35,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:35,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:52:35,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:35,965 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:35,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:35,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:36,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,012 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-28 10:52:36,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:36,053 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:52:36,054 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,065 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,075 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,087 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,133 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:36,134 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,136 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,141 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,157 INFO L315 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-28 10:52:36,158 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-28 10:52:36,195 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:52:36,196 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,206 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:36,207 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-28 10:52:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:36,219 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:36,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:52:36,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-28 10:52:36,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:36,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:52:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:52:36,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:52:36,284 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-28 10:52:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:36,344 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-28 10:52:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:52:36,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:52:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:36,345 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:52:36,346 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:52:36,346 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-28 10:52:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:52:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-28 10:52:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:52:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-28 10:52:36,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-28 10:52:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:36,352 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-28 10:52:36,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:52:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-28 10:52:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:52:36,353 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:36,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:52:36,354 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-28 10:52:36,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:36,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:36,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:36,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:36,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:52:36,421 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-28 10:52:36,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:36,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:36,653 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:36,653 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-28 10:52:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:36,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:36,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:36,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:36,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:36,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:36,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:52:36,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:36,806 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:36,807 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,830 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,918 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:36,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 10:52:36,940 INFO L442 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 20 [2019-02-28 10:52:36,943 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:37,023 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:52:37,024 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:37,033 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:37,041 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:37,053 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:37,089 INFO L315 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-28 10:52:37,089 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-28 10:52:37,178 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:52:37,180 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:37,224 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:37,225 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:22 [2019-02-28 10:52:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:37,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:37,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:37,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:52:37,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:37,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:52:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:52:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:52:37,276 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-28 10:52:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:37,430 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-28 10:52:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:52:37,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:52:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:37,432 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:52:37,432 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:52:37,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:52:37,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:52:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-28 10:52:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:52:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-28 10:52:37,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-28 10:52:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:37,439 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-28 10:52:37,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:52:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-28 10:52:37,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:37,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:37,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:37,440 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:37,441 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-28 10:52:37,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:37,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:37,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:37,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:37,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:37,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:37,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:37,529 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-28 10:52:37,531 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:37,531 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:39,376 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:39,377 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-28 10:52:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:39,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:39,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:39,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:39,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:39,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:39,391 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:52:39,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:39,427 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:39,428 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,433 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,444 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,457 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,483 INFO L442 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-28 10:52:39,488 INFO L442 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 20 [2019-02-28 10:52:39,493 INFO L442 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 22 [2019-02-28 10:52:39,496 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:39,497 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,507 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,517 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,525 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,550 INFO L315 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-28 10:52:39,551 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:39,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:39,572 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,591 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:39,591 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:39,607 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:39,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:39,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:52:39,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:52:39,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:39,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:52:39,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:52:39,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:52:39,634 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-28 10:52:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:39,675 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-28 10:52:39,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:39,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:52:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:39,677 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:52:39,677 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:52:39,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:52:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:52:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-28 10:52:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:52:39,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-28 10:52:39,683 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-28 10:52:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:39,684 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-28 10:52:39,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:52:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-28 10:52:39,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:39,684 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:39,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:39,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:39,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-28 10:52:39,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:39,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:39,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:39,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:39,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:39,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:39,743 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-28 10:52:39,745 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:39,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:40,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:40,300 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-28 10:52:40,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:40,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:40,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:40,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:40,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:40,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:40,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:40,335 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:40,343 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,344 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:40,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,356 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:40,362 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:40,374 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:40,375 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,390 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,403 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,414 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,457 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:40,458 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,463 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,469 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,482 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,534 INFO L315 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-28 10:52:40,535 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:40,564 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:40,565 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,586 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:40,587 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:40,628 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:52:40,629 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:40,645 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:40,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-28 10:52:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:40,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:40,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:40,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:52:40,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:40,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:40,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:40,709 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-28 10:52:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:40,980 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-28 10:52:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:52:40,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:52:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:40,982 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:52:40,982 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:52:40,983 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-28 10:52:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:52:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-28 10:52:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:52:40,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-28 10:52:40,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-28 10:52:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:40,990 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-28 10:52:40,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-28 10:52:40,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:40,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:40,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:40,991 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:40,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:40,991 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-28 10:52:40,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:40,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:40,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:40,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:41,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:41,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:41,078 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:41,078 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-28 10:52:41,081 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:41,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:41,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:41,707 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-28 10:52:41,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:41,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:41,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:41,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:41,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:41,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:41,724 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:41,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:41,781 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:41,781 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,791 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,800 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,817 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,832 INFO L442 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-28 10:52:41,835 INFO L442 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 20 [2019-02-28 10:52:41,838 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 22 [2019-02-28 10:52:41,841 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:41,841 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,853 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,859 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,868 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,888 INFO L315 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-28 10:52:41,888 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:41,913 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:41,914 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,933 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:41,933 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:41,974 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:52:41,976 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:41,991 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:41,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:52:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:42,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:42,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:42,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:52:42,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:42,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:42,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:42,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:42,237 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-28 10:52:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:42,564 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-28 10:52:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:52:42,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:52:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:42,566 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:52:42,566 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:52:42,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:52:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:52:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-28 10:52:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:52:42,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-28 10:52:42,582 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-28 10:52:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:42,582 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-28 10:52:42,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-28 10:52:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:42,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:42,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:42,585 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:42,586 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-28 10:52:42,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:42,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:42,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:42,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:42,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:42,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:42,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:42,747 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:42,747 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-28 10:52:42,752 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:42,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:43,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:43,326 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-28 10:52:43,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:43,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:43,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:43,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:43,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:43,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:43,342 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:43,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:43,350 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:43,356 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,356 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:43,359 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,364 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:43,369 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:43,380 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:43,380 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,403 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,415 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,426 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,473 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:43,473 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,482 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,496 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,510 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,536 INFO L315 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-28 10:52:43,536 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:43,590 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:43,591 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,625 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:43,626 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-28 10:52:43,658 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:52:43,659 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:43,672 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:43,673 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-28 10:52:43,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:43,692 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:43,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:52:43,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:43,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:52:43,743 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-28 10:52:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:43,935 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-28 10:52:43,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:52:43,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:52:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:43,938 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:52:43,938 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:52:43,938 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-28 10:52:43,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:52:43,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-28 10:52:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:52:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-28 10:52:43,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-28 10:52:43,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:43,947 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-28 10:52:43,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:43,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-28 10:52:43,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:43,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:43,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:43,949 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:43,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:43,949 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-28 10:52:43,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:43,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:43,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:43,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:44,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:44,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:44,001 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:44,001 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-28 10:52:44,004 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:44,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:44,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:44,167 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-28 10:52:44,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:44,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:44,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:44,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:44,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:44,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:44,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:52:44,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:44,228 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:44,229 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,239 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,248 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,259 INFO L442 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-28 10:52:44,265 INFO L442 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 20 [2019-02-28 10:52:44,269 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:44,301 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:52:44,302 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,314 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,321 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,329 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,343 INFO L315 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-28 10:52:44,343 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-28 10:52:44,369 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:52:44,370 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,380 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:44,380 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-28 10:52:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:52:44,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:44,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:52:44,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:52:44,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:52:44,435 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-28 10:52:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:44,586 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-28 10:52:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:52:44,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:52:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:44,588 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:52:44,588 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:52:44,589 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-28 10:52:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:52:44,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-28 10:52:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:52:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-28 10:52:44,597 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-28 10:52:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:44,598 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-28 10:52:44,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:52:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-28 10:52:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:44,598 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:44,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:44,599 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-28 10:52:44,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:44,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:44,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:44,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:44,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:44,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:44,664 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-28 10:52:44,666 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:44,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:44,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:44,916 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-28 10:52:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:44,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:44,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:44,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:44,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:44,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:44,951 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:44,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:44,955 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:44,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,958 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:44,962 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,964 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,966 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,966 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:44,969 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,971 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,973 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,975 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,977 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,979 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:44,980 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:44,981 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:44,992 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,003 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,013 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,050 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:45,051 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,059 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,064 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,075 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,094 INFO L315 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-28 10:52:45,095 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:45,120 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:45,121 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,141 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:45,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:45,170 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:52:45,171 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,182 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:45,182 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:52:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:45,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:45,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:45,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:52:45,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:45,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:45,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:45,244 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-28 10:52:45,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:45,569 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-28 10:52:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:52:45,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:52:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:45,571 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:52:45,571 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:52:45,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:52:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:52:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-28 10:52:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:52:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-28 10:52:45,582 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-28 10:52:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:45,582 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-28 10:52:45,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-28 10:52:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:52:45,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:45,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:52:45,583 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-28 10:52:45,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:45,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:45,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:45,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:45,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:45,609 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:52:45,609 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-28 10:52:45,614 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:45,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:45,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:45,759 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-28 10:52:45,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:45,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:45,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:45,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:45,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:45,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:45,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:52:45,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:45,779 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:45,804 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:52:45,813 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,815 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,817 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:45,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:45,840 INFO L442 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:45,840 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,849 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,859 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,868 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,904 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:45,905 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,909 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,918 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:45,953 INFO L315 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-28 10:52:45,953 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-28 10:52:45,972 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:45,973 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,000 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:46,001 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-28 10:52:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:46,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:46,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:46,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:52:46,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:46,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:52:46,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:52:46,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:52:46,073 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-28 10:52:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:46,236 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-28 10:52:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:52:46,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-28 10:52:46,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:46,238 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:52:46,238 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:52:46,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:52:46,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:52:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-28 10:52:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:52:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-28 10:52:46,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-28 10:52:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-28 10:52:46,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:52:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-28 10:52:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:46,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:46,250 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:52:46,250 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-28 10:52:46,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:46,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:46,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:46,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:52:46,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:46,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:46,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:46,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:46,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:46,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:46,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:46,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:46,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:52:46,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:46,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:52:46,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:46,403 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:46,404 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,414 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,422 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,435 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,452 INFO L442 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-28 10:52:46,455 INFO L442 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 20 [2019-02-28 10:52:46,457 INFO L442 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 22 [2019-02-28 10:52:46,461 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:46,462 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,469 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,477 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,486 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,506 INFO L315 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-28 10:52:46,506 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:46,523 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:46,523 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,541 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:46,542 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:46,647 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 37 [2019-02-28 10:52:46,651 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,666 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:46,666 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2019-02-28 10:52:46,698 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:52:46,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:46,710 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:46,710 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:52:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:46,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:46,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:52:46,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:46,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:52:46,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:52:46,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:52:46,776 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-28 10:52:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:47,112 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-28 10:52:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:52:47,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-28 10:52:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:47,114 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:52:47,114 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:52:47,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:52:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:52:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-28 10:52:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:52:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-28 10:52:47,127 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-28 10:52:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:47,127 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-28 10:52:47,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:52:47,128 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-28 10:52:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:47,128 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:47,128 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:52:47,129 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-28 10:52:47,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:47,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:47,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:52:47,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:47,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:47,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:47,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:47,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:47,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:47,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:47,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:47,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:52:47,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:47,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:52:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:47,247 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:47,263 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,263 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:47,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,270 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:47,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,282 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,283 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:47,284 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:47,285 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,297 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,306 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,315 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,344 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:47,344 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,348 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,353 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,364 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,383 INFO L315 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-28 10:52:47,383 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:47,404 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:47,404 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,420 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:47,420 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:47,466 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:52:47,467 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,482 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:47,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-02-28 10:52:47,510 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:52:47,510 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:47,522 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:47,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:52:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:47,544 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:47,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:47,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-28 10:52:47,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:47,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:52:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:52:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:52:47,616 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-28 10:52:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:47,987 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-28 10:52:47,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:52:47,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-28 10:52:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:47,988 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:52:47,988 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:52:47,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:52:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:52:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-28 10:52:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:52:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-28 10:52:47,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-28 10:52:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:48,000 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-28 10:52:48,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:52:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-28 10:52:48,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:48,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:48,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:48,001 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:48,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:48,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-28 10:52:48,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:48,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:48,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:48,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:48,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:48,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:48,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:48,063 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-28 10:52:48,064 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:48,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:48,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:48,644 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-28 10:52:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:48,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:48,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:48,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:48,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:48,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:48,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:48,768 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:48,768 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,784 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,792 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,803 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,817 INFO L442 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-28 10:52:48,819 INFO L442 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 20 [2019-02-28 10:52:48,821 INFO L442 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 22 [2019-02-28 10:52:48,825 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:48,825 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,831 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,839 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,847 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,866 INFO L315 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-28 10:52:48,867 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:48,888 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:48,889 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,906 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:48,906 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:48,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:52:48,935 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:48,947 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:48,948 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:52:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:48,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:49,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:49,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:52:49,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:49,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:49,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:49,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:49,015 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-28 10:52:49,432 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-02-28 10:52:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:49,563 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-28 10:52:49,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:52:49,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:52:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:49,565 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:52:49,565 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:52:49,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:52:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:52:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-28 10:52:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:52:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-28 10:52:49,577 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-28 10:52:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-28 10:52:49,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-28 10:52:49,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:49,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:49,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:49,578 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:49,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-28 10:52:49,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:49,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:49,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:49,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:49,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:49,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:49,697 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-28 10:52:49,699 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:49,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:50,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:50,311 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-28 10:52:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:50,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:50,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:50,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:50,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:50,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:52:50,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:50,330 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:50,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,337 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:50,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,349 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,351 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,351 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:50,355 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,358 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:50,393 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:52:50,393 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,408 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,415 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,424 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,449 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:50,449 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,452 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,459 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,474 INFO L315 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-28 10:52:50,474 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-28 10:52:50,532 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 31 treesize of output 47 [2019-02-28 10:52:50,534 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-28 10:52:50,590 INFO L315 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-28 10:52:50,590 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:126 [2019-02-28 10:52:50,698 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 34 [2019-02-28 10:52:50,699 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,754 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 34 [2019-02-28 10:52:50,755 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,826 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 34 [2019-02-28 10:52:50,827 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:50,857 INFO L315 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-28 10:52:50,857 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:113, output treesize:71 [2019-02-28 10:52:51,279 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-02-28 10:52:51,461 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 30 [2019-02-28 10:52:51,462 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:52,240 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 39 [2019-02-28 10:52:52,241 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:52,460 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 36 [2019-02-28 10:52:52,461 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:52,487 INFO L315 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-28 10:52:52,487 INFO L209 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-28 10:52:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:52,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:52,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:52,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-28 10:52:52,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:52,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:52:52,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:52:52,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:52,559 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-28 10:52:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:53,534 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-28 10:52:53,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:52:53,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:52:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:53,536 INFO L225 Difference]: With dead ends: 81 [2019-02-28 10:52:53,536 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:52:53,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:52:53,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:52:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-28 10:52:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:52:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-28 10:52:53,551 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-28 10:52:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:53,551 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-28 10:52:53,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:52:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-28 10:52:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:53,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:53,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:53,553 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-28 10:52:53,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:53,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:53,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:53,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:53,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:53,652 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-28 10:52:53,653 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:53,654 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:54,338 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:54,338 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-28 10:52:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:54,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:54,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:54,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:54,352 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:52:54,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:54,368 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:54,374 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,374 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:54,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,382 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:54,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,389 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,391 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,393 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,395 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:54,396 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:54,396 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,470 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,483 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,492 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,520 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:54,520 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,525 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,529 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,539 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,558 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,558 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:54,581 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:54,581 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,597 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:54,597 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:52:54,632 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:52:54,632 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,646 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:54,646 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-28 10:52:54,685 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-02-28 10:52:54,686 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:54,697 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:54,697 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-28 10:52:54,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:54,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:54,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:52:54,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:54,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:52:54,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:52:54,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:52:54,772 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-28 10:52:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:55,173 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-28 10:52:55,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:52:55,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:52:55,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:55,175 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:52:55,175 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:52:55,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:52:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:52:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-28 10:52:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:52:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-28 10:52:55,191 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-28 10:52:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:55,192 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-28 10:52:55,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:52:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-28 10:52:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:55,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:55,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:55,193 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:55,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-28 10:52:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:55,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:55,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:55,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:55,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:55,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:55,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:55,274 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-28 10:52:55,275 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:55,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:55,783 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:55,783 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-28 10:52:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:55,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:55,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:55,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:55,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:55,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:55,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:52:55,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:55,846 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:52:55,847 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,858 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,870 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,881 INFO L442 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-28 10:52:55,894 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:52:55,901 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:55,905 INFO L442 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:55,905 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,911 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,919 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,925 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:55,942 INFO L315 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-28 10:52:55,942 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-28 10:52:55,994 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:52:55,995 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:56,005 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:56,005 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-02-28 10:52:56,029 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-02-28 10:52:56,030 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:56,036 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:56,036 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-28 10:52:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:56,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:56,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:52:56,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:56,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:52:56,097 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-28 10:52:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:56,428 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-28 10:52:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:52:56,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:52:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:56,430 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:52:56,430 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:52:56,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:52:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:52:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-28 10:52:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:52:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-28 10:52:56,444 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-28 10:52:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-28 10:52:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-28 10:52:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:56,445 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:56,445 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:56,445 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:56,445 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-28 10:52:56,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:56,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:56,509 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-28 10:52:56,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:52:56,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:52:56,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:56,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:52:56,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:52:56,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:52:56,510 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-28 10:52:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:56,567 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-28 10:52:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:52:56,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:52:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:56,568 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:52:56,568 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:52:56,569 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-28 10:52:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:52:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-28 10:52:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:52:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-28 10:52:56,585 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-28 10:52:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:56,585 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-28 10:52:56,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:52:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-28 10:52:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:56,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:56,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:56,586 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-28 10:52:56,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:56,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:56,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:56,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:56,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:56,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:56,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:56,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:56,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:56,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:56,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:52:56,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:56,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:52:56,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:56,709 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:56,712 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,712 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:56,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,720 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,720 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:52:56,722 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,723 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:56,729 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 21 [2019-02-28 10:52:56,730 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:56,851 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:56,980 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,103 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,201 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:57,202 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,204 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,212 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,222 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,241 INFO L315 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-28 10:52:57,242 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:57,266 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:57,266 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,282 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:57,283 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-28 10:52:57,316 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-02-28 10:52:57,316 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,327 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:57,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-02-28 10:52:57,369 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:52:57,369 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:57,379 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:57,379 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-28 10:52:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:57,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:57,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:52:57,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:57,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:52:57,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:52:57,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:52:57,445 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-28 10:52:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:58,152 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-28 10:52:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:52:58,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-28 10:52:58,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:58,153 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:52:58,154 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:52:58,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:52:58,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:52:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-28 10:52:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:52:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-28 10:52:58,176 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-28 10:52:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:58,176 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-28 10:52:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:52:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-28 10:52:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:58,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:58,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:58,177 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-28 10:52:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:58,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:58,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:58,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:58,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:58,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:58,221 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:58,221 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-28 10:52:58,222 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:58,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:58,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:58,444 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-28 10:52:58,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:58,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:58,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:58,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:58,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:58,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:58,471 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:58,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:58,480 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:52:58,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,482 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:52:58,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,489 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-28 10:52:58,493 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,497 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,500 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,502 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,504 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:52:58,504 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:58,504 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,518 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,532 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,545 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,576 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:58,577 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,579 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,585 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,596 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,618 INFO L315 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-28 10:52:58,619 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:58,637 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:58,637 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,657 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:58,658 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-28 10:52:58,715 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-02-28 10:52:58,716 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,735 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:58,735 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-28 10:52:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:58,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:52:58,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:58,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:52:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:52:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:52:58,817 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-28 10:52:58,995 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-02-28 10:52:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:59,150 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-28 10:52:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:52:59,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:52:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:59,152 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:52:59,153 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:52:59,153 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-28 10:52:59,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:52:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-28 10:52:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:52:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-28 10:52:59,174 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-28 10:52:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:59,174 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-28 10:52:59,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:52:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-28 10:52:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:52:59,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:59,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:52:59,176 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:52:59,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:59,176 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-28 10:52:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:59,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:59,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:52:59,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:59,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:59,230 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:52:59,230 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-28 10:52:59,231 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:52:59,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:59,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:52:59,510 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-28 10:52:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:59,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:52:59,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:59,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:59,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:59,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:59,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:52:59,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:59,687 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:52:59,688 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,690 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,698 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,709 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,724 INFO L442 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-28 10:52:59,728 INFO L442 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 20 [2019-02-28 10:52:59,729 INFO L442 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 22 [2019-02-28 10:52:59,731 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:52:59,731 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,740 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,748 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,756 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,775 INFO L315 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-28 10:52:59,775 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:52:59,808 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:52:59,809 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,824 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:59,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-28 10:52:59,881 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:52:59,882 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:59,912 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:52:59,913 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-28 10:52:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:59,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:00,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:00,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-28 10:53:00,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:00,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:53:00,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:53:00,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:53:00,017 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-28 10:53:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:00,242 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-28 10:53:00,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:53:00,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-28 10:53:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:00,246 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:53:00,246 INFO L226 Difference]: Without dead ends: 62 [2019-02-28 10:53:00,246 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-28 10:53:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-28 10:53:00,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-28 10:53:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:53:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-28 10:53:00,262 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-28 10:53:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-28 10:53:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:53:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-28 10:53:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:53:00,262 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:00,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:53:00,263 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:00,263 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-28 10:53:00,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:00,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:00,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:00,488 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-28 10:53:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:00,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:00,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:00,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:00,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:00,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:00,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:00,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:00,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:00,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:53:00,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:00,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:53:00,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:00,521 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:00,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,526 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20 [2019-02-28 10:53:00,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,530 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,531 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:00,534 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,537 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:00,541 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:00,542 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,549 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,558 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,567 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,597 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:00,597 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,618 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,622 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,632 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,651 INFO L315 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-28 10:53:00,652 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:00,686 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:00,687 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,703 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:00,703 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:00,727 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:00,728 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:00,743 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:00,743 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:00,757 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:53:00,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:00,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:53:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:53:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:53:00,795 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-28 10:53:00,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:01,000 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-28 10:53:01,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:53:01,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:53:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:01,002 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:53:01,002 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:53:01,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-28 10:53:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:53:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-28 10:53:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:53:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-28 10:53:01,023 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-28 10:53:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:01,024 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-28 10:53:01,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:53:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-28 10:53:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:01,025 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:01,025 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 10:53:01,025 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-28 10:53:01,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:01,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:01,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:53:01,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:01,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:01,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:01,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:01,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:01,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:01,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:01,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:01,121 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:01,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:01,122 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:01,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:01,155 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:01,156 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,162 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,175 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,185 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,201 INFO L442 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-28 10:53:01,203 INFO L442 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 20 [2019-02-28 10:53:01,205 INFO L442 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 22 [2019-02-28 10:53:01,208 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:01,208 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,232 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,241 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,248 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,267 INFO L315 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-28 10:53:01,267 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:01,286 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:01,287 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,302 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:01,302 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:01,400 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 49 [2019-02-28 10:53:01,401 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,417 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:01,417 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-02-28 10:53:01,449 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:01,450 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,463 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:01,464 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:01,507 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-02-28 10:53:01,507 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:01,517 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:01,517 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:01,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-28 10:53:01,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:01,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:53:01,596 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-28 10:53:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:02,025 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-28 10:53:02,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:02,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:53:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:02,027 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:53:02,027 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:53:02,028 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-28 10:53:02,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:53:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-28 10:53:02,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:53:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-28 10:53:02,054 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-28 10:53:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:02,054 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-28 10:53:02,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-28 10:53:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:02,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:02,054 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:53:02,055 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:02,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-28 10:53:02,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:02,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:02,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:02,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:02,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:02,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:02,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:02,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:02,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:02,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:02,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:02,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:02,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:02,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:02,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:02,158 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:02,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:02,181 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:02,181 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,186 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,196 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,208 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,224 INFO L442 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-28 10:53:02,226 INFO L442 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 20 [2019-02-28 10:53:02,230 INFO L442 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 22 [2019-02-28 10:53:02,231 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:02,232 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,240 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,248 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,255 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,273 INFO L315 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-28 10:53:02,274 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:02,296 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:02,297 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,315 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:02,316 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:02,378 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 49 [2019-02-28 10:53:02,379 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,460 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:02,460 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:35 [2019-02-28 10:53:02,574 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-28 10:53:02,676 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:02,677 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,688 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:02,688 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:02,792 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:02,792 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:02,802 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:02,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-28 10:53:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:02,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:02,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:02,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:53:02,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:02,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:02,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:02,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:02,918 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-28 10:53:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:03,364 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-28 10:53:03,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:03,365 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:53:03,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:03,366 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:53:03,366 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:53:03,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:53:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-28 10:53:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:53:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-28 10:53:03,393 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-28 10:53:03,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:03,393 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-28 10:53:03,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-28 10:53:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:03,394 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:03,394 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:53:03,394 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:03,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:03,395 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-28 10:53:03,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:03,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:03,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:03,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:03,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:03,519 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:03,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:03,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:03,519 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:03,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:03,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:03,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:03,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:03,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:03,532 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:03,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:03,536 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:03,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,540 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:03,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,554 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,554 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:03,560 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:03,574 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:03,574 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,583 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,590 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,597 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,626 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:03,627 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,631 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,640 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,651 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,669 INFO L315 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-28 10:53:03,670 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:03,693 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:03,693 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,711 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:03,712 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:03,754 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:03,754 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,767 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:03,767 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:03,828 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-02-28 10:53:03,829 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,848 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:03,849 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:03,913 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:03,914 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:03,931 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:03,932 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-28 10:53:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:03,953 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:04,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:04,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:53:04,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:04,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:04,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:04,046 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-28 10:53:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:04,482 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-28 10:53:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:04,483 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:53:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:04,485 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:53:04,485 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:53:04,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:53:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-28 10:53:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:53:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-28 10:53:04,509 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-28 10:53:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:04,510 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-28 10:53:04,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-28 10:53:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:04,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:04,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:04,510 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:04,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-28 10:53:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:04,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:04,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:04,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:04,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:04,611 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-28 10:53:04,612 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:04,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:05,106 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:05,106 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-28 10:53:05,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:05,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:05,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:05,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:05,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:05,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:05,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:53:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:05,126 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:05,134 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:05,138 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,143 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:05,147 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,149 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:05,158 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:05,158 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,174 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,186 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,196 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,223 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:05,224 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,230 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,237 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,247 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,265 INFO L315 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-28 10:53:05,265 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:05,286 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:05,287 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,305 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:05,305 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:05,370 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:05,371 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:05,385 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:05,386 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:05,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:05,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:05,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:53:05,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:05,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:53:05,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:53:05,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:53:05,442 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-28 10:53:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:05,714 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-28 10:53:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:53:05,714 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:53:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:05,716 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:53:05,716 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:53:05,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:53:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-28 10:53:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:53:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-28 10:53:05,739 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-28 10:53:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:05,739 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-28 10:53:05,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:53:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-28 10:53:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:05,740 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:05,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:05,740 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-28 10:53:05,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:05,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:05,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:05,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:05,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:06,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:06,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:06,283 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:06,283 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-28 10:53:06,284 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:06,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:06,906 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:06,906 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-28 10:53:06,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:06,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:06,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:06,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:06,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:06,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:06,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:06,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:06,925 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:06,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:06,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,937 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:06,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,951 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:06,951 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:06,952 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:06,962 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:06,972 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:06,983 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,015 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:07,015 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,019 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,029 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,039 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,058 INFO L315 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-28 10:53:07,058 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:07,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:07,079 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,095 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:07,095 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:07,126 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:07,126 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,139 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:07,140 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:07,183 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:07,184 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:07,197 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:07,198 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-28 10:53:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:07,215 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:07,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:07,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:53:07,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:07,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:07,257 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-28 10:53:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:07,615 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-28 10:53:07,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:07,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:53:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:07,617 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:53:07,617 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:53:07,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:53:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-28 10:53:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:53:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-28 10:53:07,648 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-28 10:53:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:07,648 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-28 10:53:07,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-28 10:53:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:07,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:07,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:07,649 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-28 10:53:07,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:07,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:07,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:07,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:07,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:07,734 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-28 10:53:07,737 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:07,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:08,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:08,287 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-28 10:53:08,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:08,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:08,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:08,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:08,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:08,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:08,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:08,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:08,306 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:08,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,346 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:08,394 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,420 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,442 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,446 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:08,486 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,508 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,542 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,556 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:08,580 INFO L289 Elim1Store]: Index analysis took 119 ms [2019-02-28 10:53:08,581 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:08,581 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,684 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,802 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,910 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,956 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:08,956 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,960 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,965 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,974 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,993 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:08,993 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:09,017 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:09,018 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:09,034 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:09,034 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:09,074 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:09,075 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:09,087 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:09,087 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:09,128 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:09,129 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:09,138 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:09,138 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:09,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:53:09,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:09,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:53:09,216 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-28 10:53:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:09,558 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-28 10:53:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:53:09,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:53:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:09,560 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:53:09,560 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:53:09,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:09,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:53:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-28 10:53:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:53:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-28 10:53:09,591 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-28 10:53:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:09,592 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-28 10:53:09,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-28 10:53:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:09,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:09,593 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:53:09,593 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-28 10:53:09,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:09,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:09,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:09,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:09,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:09,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:09,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:09,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:09,647 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-28 10:53:09,648 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:09,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:10,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:10,224 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-28 10:53:10,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:10,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:10,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:10,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:10,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:10,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:10,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:10,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:10,267 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:10,268 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,282 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,294 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,309 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 10:53:10,325 INFO L442 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 20 [2019-02-28 10:53:10,327 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 22 [2019-02-28 10:53:10,330 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:10,330 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,337 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,345 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,353 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,372 INFO L315 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-28 10:53:10,373 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:10,394 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:10,395 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,413 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:10,413 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:10,447 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:10,448 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,461 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:10,461 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:10,513 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:53:10,514 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,524 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:10,525 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:10,568 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:10,568 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:10,580 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:10,580 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:10,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:10,646 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-28 10:53:10,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:10,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:53:10,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:10,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:10,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:10,667 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-28 10:53:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:11,117 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-28 10:53:11,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:11,118 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:53:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:11,119 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:53:11,120 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:53:11,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:53:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-28 10:53:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:53:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-28 10:53:11,148 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-28 10:53:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:11,148 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-28 10:53:11,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:11,148 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-28 10:53:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:11,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:11,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:11,149 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:11,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-28 10:53:11,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:11,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:11,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:11,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:11,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:11,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:11,273 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:11,273 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-28 10:53:11,274 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:11,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:11,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:11,586 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-28 10:53:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:11,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:11,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:11,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:11,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:11,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:11,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:53:11,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:11,604 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:11,608 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,608 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:11,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,618 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,621 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:11,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,634 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,638 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:11,639 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:11,639 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,655 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,665 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,673 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,704 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:11,704 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,708 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,716 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,726 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,746 INFO L315 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-28 10:53:11,746 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:11,767 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:11,768 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,785 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:11,785 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:11,830 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:11,831 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:11,846 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:11,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-28 10:53:11,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:11,863 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:11,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-28 10:53:11,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:11,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:53:11,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:53:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:53:11,901 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-28 10:53:12,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:12,693 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-28 10:53:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:53:12,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-28 10:53:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:12,695 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:53:12,695 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:53:12,696 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-28 10:53:12,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:53:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-28 10:53:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:53:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-28 10:53:12,738 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-28 10:53:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:12,738 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-28 10:53:12,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:53:12,738 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-28 10:53:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:12,739 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:12,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:12,739 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:12,739 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-28 10:53:12,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:12,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:12,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:12,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:12,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:12,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:12,798 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-28 10:53:12,799 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:12,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:13,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:13,087 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-28 10:53:13,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:13,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:13,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:13,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:13,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:13,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:13,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:53:13,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:13,131 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:13,136 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,136 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:13,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,142 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,144 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,144 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:13,151 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:13,183 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:53:13,184 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,191 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,198 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,208 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,229 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:53:13,229 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,232 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,238 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,251 INFO L315 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-28 10:53:13,251 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-28 10:53:13,280 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:53:13,280 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,290 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:13,290 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-28 10:53:13,315 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 28 [2019-02-28 10:53:13,316 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,324 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:13,324 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-28 10:53:13,360 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 35 [2019-02-28 10:53:13,361 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:13,371 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:13,372 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:22 [2019-02-28 10:53:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:13,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:13,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:13,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:53:13,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:13,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:13,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:13,431 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-28 10:53:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:13,755 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-28 10:53:13,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:13,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-28 10:53:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:13,758 INFO L225 Difference]: With dead ends: 122 [2019-02-28 10:53:13,758 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:53:13,759 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-28 10:53:13,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:53:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-28 10:53:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:53:13,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-28 10:53:13,805 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-28 10:53:13,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:13,806 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-28 10:53:13,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-28 10:53:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:13,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:13,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:13,807 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-28 10:53:13,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:13,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:13,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:13,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:13,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:13,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:13,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:13,963 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-28 10:53:13,964 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:13,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:14,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:14,404 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-28 10:53:14,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:14,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:14,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:14,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:14,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:14,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:53:14,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:14,441 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:53:14,441 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,448 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,461 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,476 INFO L442 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-28 10:53:14,491 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:14,497 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:14,500 INFO L442 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:14,501 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,511 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,518 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,526 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,543 INFO L315 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-28 10:53:14,543 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-28 10:53:14,570 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:53:14,571 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,582 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:14,582 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-02-28 10:53:14,607 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-02-28 10:53:14,608 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:14,617 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:14,618 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2019-02-28 10:53:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:14,632 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:14,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:53:14,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:14,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:53:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:53:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:53:14,674 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-28 10:53:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:14,897 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-28 10:53:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:53:14,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:53:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:14,901 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:53:14,901 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:53:14,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:53:14,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-28 10:53:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:53:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-28 10:53:14,955 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-28 10:53:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:14,955 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-28 10:53:14,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:53:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-28 10:53:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:14,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:14,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:14,956 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:14,956 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-28 10:53:14,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:14,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:15,141 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-28 10:53:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:15,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:15,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:15,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:15,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:15,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:15,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:15,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:15,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:15,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:15,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:15,171 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:15,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:15,183 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:15,184 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,189 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,198 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,210 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,223 INFO L442 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-28 10:53:15,225 INFO L442 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 20 [2019-02-28 10:53:15,227 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 22 [2019-02-28 10:53:15,229 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:15,230 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,238 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,246 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,253 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,272 INFO L315 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-28 10:53:15,273 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:15,293 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:15,294 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,311 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:15,311 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:15,338 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:15,338 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,351 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:15,352 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:15,395 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:15,396 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:15,405 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:15,406 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:15,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:15,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:53:15,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:15,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:53:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:53:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:15,497 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-28 10:53:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:15,854 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-28 10:53:15,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:53:15,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-28 10:53:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:15,856 INFO L225 Difference]: With dead ends: 137 [2019-02-28 10:53:15,857 INFO L226 Difference]: Without dead ends: 136 [2019-02-28 10:53:15,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:53:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-28 10:53:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-28 10:53:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:53:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-28 10:53:15,903 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-28 10:53:15,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:15,903 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-28 10:53:15,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:53:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-28 10:53:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:15,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:15,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:15,904 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:15,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-28 10:53:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:15,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:15,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:16,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:16,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:16,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:16,233 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:16,233 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-28 10:53:16,235 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:16,235 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:16,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:16,817 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-28 10:53:16,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:16,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:16,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:16,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:16,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:16,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:16,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:53:16,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:16,842 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:53:16,842 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,856 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,871 INFO L442 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-28 10:53:16,889 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:16,912 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-02-28 10:53:16,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:16,916 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,924 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,930 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,938 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,951 INFO L315 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-28 10:53:16,951 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-28 10:53:16,972 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:53:16,972 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,977 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:16,977 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-28 10:53:17,019 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:53:17,020 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,024 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:17,025 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-02-28 10:53:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:17,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:53:17,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:17,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:53:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:53:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:53:17,075 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-28 10:53:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:17,275 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-28 10:53:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:53:17,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-28 10:53:17,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:17,278 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:53:17,278 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:53:17,279 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-28 10:53:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:53:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-28 10:53:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:53:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-28 10:53:17,326 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-28 10:53:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:17,326 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-28 10:53:17,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:53:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-28 10:53:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:17,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:17,327 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-28 10:53:17,327 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-28 10:53:17,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:17,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:17,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:17,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:17,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:17,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:17,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:17,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:17,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:17,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:17,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:17,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:17,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:17,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:17,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:17,465 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:17,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,472 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:17,474 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,475 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,476 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,476 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:17,478 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,483 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:17,485 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:17,485 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,494 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,503 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,512 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,538 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:17,539 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,541 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,547 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,557 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,576 INFO L315 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-28 10:53:17,576 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:17,597 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:17,597 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,612 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:17,613 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:17,641 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-02-28 10:53:17,642 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,652 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:17,653 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-02-28 10:53:17,690 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:17,691 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,700 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:17,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:17,752 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:53:17,752 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:17,764 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:17,764 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:17,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-28 10:53:17,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:17,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:17,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:17,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:53:17,842 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-28 10:53:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:18,266 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-28 10:53:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:18,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-28 10:53:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:18,268 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:53:18,268 INFO L226 Difference]: Without dead ends: 116 [2019-02-28 10:53:18,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=190, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-28 10:53:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-28 10:53:18,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:53:18,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-28 10:53:18,314 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-28 10:53:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:18,315 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-28 10:53:18,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:18,315 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-28 10:53:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:18,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:18,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:18,316 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:18,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:18,316 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-28 10:53:18,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:18,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:18,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:18,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:18,491 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-28 10:53:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:18,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:18,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:18,623 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:53:18,623 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-28 10:53:18,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:18,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:19,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:19,311 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-28 10:53:19,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:19,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:19,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:19,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:19,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:19,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:19,323 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:19,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:19,326 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:19,332 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,333 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:19,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,350 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,352 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,353 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:19,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,368 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,370 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,372 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:19,372 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:19,372 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,386 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,396 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,406 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,447 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:19,447 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,453 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,461 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,483 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,507 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,508 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:19,541 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:19,541 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,557 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:19,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:19,590 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:19,591 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,603 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:19,604 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2019-02-28 10:53:19,656 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:19,657 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,667 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:19,667 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-28 10:53:19,727 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 47 [2019-02-28 10:53:19,728 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:19,739 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:19,739 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-28 10:53:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:19,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:19,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:53:19,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:19,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:53:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:53:19,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:19,817 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-28 10:53:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:20,343 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-28 10:53:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:20,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:53:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:20,346 INFO L225 Difference]: With dead ends: 137 [2019-02-28 10:53:20,346 INFO L226 Difference]: Without dead ends: 136 [2019-02-28 10:53:20,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:53:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-28 10:53:20,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-28 10:53:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:53:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-28 10:53:20,411 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-28 10:53:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:20,411 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-28 10:53:20,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:53:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-28 10:53:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:20,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:20,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:20,412 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-28 10:53:20,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:20,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:20,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:20,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:20,583 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-28 10:53:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:20,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:20,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:20,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:20,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:20,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:20,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:20,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:20,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:20,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:20,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:20,662 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:20,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:20,665 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:20,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,672 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:20,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,676 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,677 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-28 10:53:20,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,683 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:20,685 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:20,685 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,694 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,701 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,708 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,737 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:20,737 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,740 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,748 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,758 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,776 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,777 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:20,804 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:20,804 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,820 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:20,821 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:20,858 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:20,858 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,872 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:20,873 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-28 10:53:20,913 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 32 [2019-02-28 10:53:20,914 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,925 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:20,926 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:27 [2019-02-28 10:53:20,975 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:53:20,976 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:20,989 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:20,990 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-02-28 10:53:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:21,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:21,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:21,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:53:21,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:21,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:53:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:53:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:21,081 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-28 10:53:21,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:21,699 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-28 10:53:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:21,699 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:53:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:21,702 INFO L225 Difference]: With dead ends: 172 [2019-02-28 10:53:21,702 INFO L226 Difference]: Without dead ends: 167 [2019-02-28 10:53:21,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-28 10:53:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-28 10:53:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-28 10:53:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-28 10:53:21,764 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-28 10:53:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:21,764 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-28 10:53:21,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:53:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-28 10:53:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:53:21,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:21,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:53:21,765 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-28 10:53:21,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:21,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:21,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:21,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:22,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:22,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:22,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:22,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:22,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:22,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:22,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:22,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:22,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:22,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:22,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:22,033 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:22,034 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,038 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,048 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,059 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,073 INFO L442 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-28 10:53:22,075 INFO L442 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 20 [2019-02-28 10:53:22,077 INFO L442 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 22 [2019-02-28 10:53:22,079 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:22,079 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,088 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,096 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,157 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,175 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,175 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:22,203 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:22,204 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,221 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:22,221 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:22,262 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:22,262 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,276 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:22,277 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-28 10:53:22,324 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 36 [2019-02-28 10:53:22,325 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,336 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:22,337 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:27 [2019-02-28 10:53:22,402 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:53:22,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:22,414 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:22,415 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-02-28 10:53:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:22,431 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:22,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:22,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-28 10:53:22,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:22,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:53:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:53:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:22,502 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-28 10:53:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:22,943 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-28 10:53:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:22,943 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-28 10:53:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:22,945 INFO L225 Difference]: With dead ends: 140 [2019-02-28 10:53:22,945 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:53:22,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:53:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:53:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-28 10:53:22,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:53:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-28 10:53:22,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-28 10:53:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:22,998 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-28 10:53:22,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:53:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-28 10:53:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:22,998 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:22,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:22,999 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-28 10:53:22,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:23,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:23,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:23,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:23,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:23,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:23,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:23,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:23,128 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-28 10:53:23,128 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:23,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:23,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:23,728 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-28 10:53:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:23,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:23,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:23,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:23,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:23,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:23,742 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:23,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:23,745 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:23,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,753 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:23,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,761 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:23,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,776 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:23,778 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:23,779 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,794 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,803 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,810 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,840 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:23,840 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,842 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,848 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,858 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,876 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,877 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:23,901 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:23,902 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,920 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:23,920 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:23,952 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:23,952 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:23,966 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:23,966 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:24,009 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:24,009 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:24,021 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:24,021 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-28 10:53:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:24,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:24,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:24,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:53:24,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:24,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:24,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:24,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:24,089 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-28 10:53:24,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:24,625 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-28 10:53:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:24,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:53:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:24,626 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:53:24,626 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:53:24,627 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-28 10:53:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:53:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-28 10:53:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:53:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-28 10:53:24,686 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-28 10:53:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:24,687 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-28 10:53:24,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-28 10:53:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:24,687 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:24,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:24,687 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:24,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:24,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-28 10:53:24,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:24,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:24,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:24,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:24,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:24,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:24,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:24,769 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-28 10:53:24,771 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:24,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:25,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:25,580 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-28 10:53:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:25,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:25,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:25,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:25,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:25,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:25,593 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:25,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:25,598 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:25,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,603 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:25,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,611 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:25,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,621 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,627 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,629 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:25,629 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:25,629 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,643 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,657 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,671 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,699 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:25,699 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,702 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,708 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,717 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,736 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,736 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:25,760 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:25,760 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,777 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:25,777 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:25,862 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:25,863 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,876 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:25,876 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:25,921 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:25,922 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,935 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:25,935 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:25,985 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 45 [2019-02-28 10:53:25,986 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:25,997 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:25,998 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-02-28 10:53:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:26,017 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:26,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:26,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:53:26,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:26,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:53:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:53:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:26,085 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-28 10:53:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:26,620 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-28 10:53:26,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:26,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-28 10:53:26,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:26,622 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:53:26,622 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:53:26,623 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-28 10:53:26,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:53:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-28 10:53:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:53:26,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-28 10:53:26,676 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-28 10:53:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:26,676 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-28 10:53:26,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:53:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-28 10:53:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:26,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:26,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:26,677 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-28 10:53:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:26,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:26,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:26,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:26,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:26,784 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-28 10:53:26,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:26,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:27,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:27,491 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-28 10:53:27,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:27,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:27,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:27,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:27,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:27,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:27,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:53:27,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:27,537 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:27,578 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:27,592 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-02-28 10:53:27,615 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 22 treesize of output 30 [2019-02-28 10:53:27,616 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,622 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,629 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,636 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,644 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:27,644 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-28 10:53:27,670 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:53:27,671 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:53:27,680 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 10:53:27,680 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:25 [2019-02-28 10:53:27,697 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2019-02-28 10:53:27,698 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,718 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:53:27,719 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:27,728 INFO L315 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-28 10:53:27,729 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:27 [2019-02-28 10:53:27,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-28 10:53:27,744 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:27,758 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-28 10:53:27,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:53:27,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-28 10:53:27,778 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:27,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:53:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:53:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:53:27,779 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-28 10:53:27,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:27,999 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-28 10:53:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:53:27,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-28 10:53:27,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:28,001 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:53:28,001 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:53:28,001 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-28 10:53:28,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:53:28,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-28 10:53:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:53:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-28 10:53:28,111 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-28 10:53:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:28,111 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-28 10:53:28,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:53:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-28 10:53:28,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:28,112 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:28,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:28,112 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-28 10:53:28,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:28,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:28,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:28,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:28,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:28,261 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-28 10:53:28,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:28,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:28,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:28,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:28,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:28,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:28,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:28,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:28,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:28,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:28,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:28,285 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:28,291 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,291 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:28,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,296 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,296 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:28,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,303 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:28,308 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:28,308 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,317 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,326 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,334 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,363 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:28,363 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,369 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,378 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,389 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,408 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,408 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:28,433 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:28,434 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,452 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:28,453 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:28,491 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:28,491 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,505 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:28,505 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:33 [2019-02-28 10:53:28,544 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-02-28 10:53:28,545 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,558 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:28,558 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-28 10:53:28,603 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 35 treesize of output 43 [2019-02-28 10:53:28,604 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:28,616 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:28,616 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-28 10:53:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:28,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:28,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:28,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-28 10:53:28,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:28,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:28,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:28,702 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-28 10:53:29,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:29,290 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-28 10:53:29,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:29,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-28 10:53:29,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:29,293 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:53:29,293 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:53:29,293 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-28 10:53:29,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:53:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-28 10:53:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:53:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-28 10:53:29,370 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-28 10:53:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:29,371 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-28 10:53:29,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:29,371 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-28 10:53:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:29,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:29,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:29,372 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:29,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:29,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-28 10:53:29,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:29,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:29,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:29,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:29,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:29,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:29,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:29,450 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-28 10:53:29,451 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:29,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:30,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:30,016 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-28 10:53:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:30,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:30,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:30,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:30,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:30,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:30,032 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:53:30,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:30,039 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:30,054 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:30,060 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,064 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:30,066 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,070 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,072 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,074 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:30,077 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:30,077 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,088 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,098 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,108 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,137 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:53:30,137 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,141 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,150 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,167 INFO L315 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-28 10:53:30,167 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-28 10:53:30,198 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:53:30,198 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,215 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:30,215 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-02-28 10:53:30,245 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 26 [2019-02-28 10:53:30,245 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,253 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:30,253 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-28 10:53:30,285 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 33 [2019-02-28 10:53:30,286 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:30,293 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:30,293 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-02-28 10:53:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:30,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:30,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:53:30,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:30,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:53:30,359 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-28 10:53:30,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:30,764 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-28 10:53:30,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:53:30,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:53:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:30,766 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:53:30,766 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:53:30,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:53:30,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-28 10:53:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:53:30,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-28 10:53:30,905 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-28 10:53:30,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:30,906 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-28 10:53:30,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:30,906 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-28 10:53:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:30,906 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:30,906 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-28 10:53:30,907 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-28 10:53:30,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:30,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:30,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:30,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:30,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:53:31,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:53:31,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:53:31,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:53:31,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:53:31,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:53:31,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:53:31,125 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-28 10:53:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:31,290 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-28 10:53:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:53:31,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-28 10:53:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:31,291 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:53:31,292 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:53:31,292 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-28 10:53:31,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:53:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-28 10:53:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:53:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-28 10:53:31,380 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-28 10:53:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:31,381 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-28 10:53:31,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:53:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-28 10:53:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:31,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:31,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:31,381 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:31,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-28 10:53:31,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:31,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:31,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:31,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:31,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:31,471 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:31,471 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-28 10:53:31,472 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:31,472 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:32,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:32,046 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-28 10:53:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:32,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:32,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:32,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:32,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:32,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:32,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:32,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:32,088 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:32,088 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,099 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,117 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,129 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,145 INFO L442 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-28 10:53:32,147 INFO L442 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 20 [2019-02-28 10:53:32,149 INFO L442 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 22 [2019-02-28 10:53:32,151 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:32,151 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,159 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,167 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,175 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,194 INFO L315 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-28 10:53:32,194 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:32,215 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:32,215 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,232 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:32,232 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:32,262 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:32,262 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,275 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:32,275 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-28 10:53:32,316 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 31 treesize of output 36 [2019-02-28 10:53:32,316 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:32,328 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:32,328 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:27 [2019-02-28 10:53:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:32,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:32,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:32,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-28 10:53:32,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:32,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:32,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:32,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:32,391 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-28 10:53:32,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:32,796 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-28 10:53:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:53:32,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:53:32,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:32,798 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:53:32,798 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:53:32,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:53:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-28 10:53:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:53:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-28 10:53:32,908 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-28 10:53:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:32,908 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-28 10:53:32,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-28 10:53:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:32,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:32,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:32,909 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-28 10:53:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:32,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:33,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:33,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:33,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:33,051 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-28 10:53:33,052 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:33,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:33,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:33,236 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-28 10:53:33,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:33,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:33,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:33,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:33,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:33,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:53:33,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:33,274 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:33,275 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,286 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,294 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,309 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,329 INFO L442 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-28 10:53:33,330 INFO L442 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 20 [2019-02-28 10:53:33,333 INFO L442 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 22 [2019-02-28 10:53:33,335 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:33,335 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,342 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,351 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,360 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,381 INFO L315 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-28 10:53:33,381 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:33,403 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:33,404 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,421 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:33,421 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:33,456 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:33,457 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:33,473 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:33,474 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:33,497 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:33,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:33,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-28 10:53:33,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:33,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:53:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:53:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:53:33,537 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-28 10:53:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:33,988 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-28 10:53:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:53:33,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-28 10:53:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:33,989 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:53:33,989 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:53:33,990 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-28 10:53:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:53:34,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-28 10:53:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:53:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-28 10:53:34,095 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-28 10:53:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:34,095 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-28 10:53:34,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:53:34,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-28 10:53:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:34,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:34,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:34,096 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:34,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-28 10:53:34,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:34,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:34,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:34,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:34,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:34,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:34,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:34,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:34,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:34,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:34,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:34,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:34,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:34,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:34,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:53:34,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:34,205 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:53:34,205 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,211 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,223 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,236 INFO L442 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-28 10:53:34,246 INFO L442 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:34,250 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:34,253 INFO L442 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:34,254 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,260 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,268 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,275 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,292 INFO L315 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-28 10:53:34,292 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-28 10:53:34,321 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-02-28 10:53:34,322 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,331 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:34,331 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2019-02-28 10:53:34,356 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 30 [2019-02-28 10:53:34,357 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,365 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:34,366 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-28 10:53:34,401 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 37 [2019-02-28 10:53:34,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:34,409 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:34,410 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2019-02-28 10:53:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:34,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:34,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:34,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-28 10:53:34,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:34,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:34,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:53:34,536 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-28 10:53:35,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:35,038 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-28 10:53:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:53:35,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:53:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:35,039 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:53:35,039 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:53:35,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:35,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:53:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-28 10:53:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:53:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-28 10:53:35,157 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-28 10:53:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:35,157 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-28 10:53:35,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-28 10:53:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:53:35,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:35,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:35,158 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:35,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:35,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-28 10:53:35,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:35,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:35,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:35,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:35,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:35,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:35,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:35,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-28 10:53:35,274 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-28 10:53:35,275 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:35,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:35,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:35,496 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-28 10:53:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:35,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:35,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:35,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:35,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:35,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:35,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:53:35,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:35,526 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:53:35,527 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,541 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,556 INFO L442 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-28 10:53:35,577 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:35,601 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-02-28 10:53:35,606 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:35,606 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,613 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,619 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,627 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,640 INFO L315 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-28 10:53:35,641 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-28 10:53:35,705 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-02-28 10:53:35,706 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:53:35,726 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 10:53:35,726 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:36 [2019-02-28 10:53:35,778 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:53:35,778 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,826 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 32 [2019-02-28 10:53:35,827 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:35,843 INFO L315 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-28 10:53:35,843 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-28 10:53:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:35,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:35,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:35,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-28 10:53:35,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:35,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:53:35,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:53:35,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:53:35,909 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-28 10:53:36,338 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-28 10:53:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:36,933 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-28 10:53:36,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:36,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-28 10:53:36,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:36,935 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:53:36,935 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:53:36,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-28 10:53:36,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:53:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-28 10:53:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:53:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-28 10:53:37,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-28 10:53:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:37,123 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-28 10:53:37,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:53:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-28 10:53:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:53:37,124 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:37,124 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:37,124 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:37,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-28 10:53:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:37,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:37,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:37,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:37,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:53:37,289 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-28 10:53:37,290 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:37,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:37,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:37,741 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-28 10:53:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:37,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:37,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:37,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:37,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:37,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:37,782 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:53:37,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:37,786 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:37,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,790 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:37,797 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,801 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,801 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:37,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,814 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,816 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,818 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:37,818 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:37,818 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,828 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,838 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,849 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,878 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:37,879 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,881 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,887 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,897 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,917 INFO L315 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-28 10:53:37,917 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:37,936 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:37,936 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,953 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:37,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:37,979 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:37,980 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,991 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:37,992 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:38,038 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-02-28 10:53:38,039 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:38,049 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:38,049 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:38,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:38,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:38,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-28 10:53:38,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:38,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:53:38,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:53:38,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:53:38,118 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-28 10:53:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:38,765 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-28 10:53:38,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:53:38,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-28 10:53:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:38,767 INFO L225 Difference]: With dead ends: 118 [2019-02-28 10:53:38,767 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:53:38,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:38,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:53:38,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-28 10:53:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:53:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-28 10:53:38,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-28 10:53:38,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:38,984 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-28 10:53:38,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:53:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-28 10:53:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:53:38,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:38,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:38,985 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-28 10:53:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:38,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:39,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:39,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:39,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:53:39,127 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-28 10:53:39,128 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:39,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:39,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:39,874 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-28 10:53:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:39,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:39,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:39,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:39,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:39,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:39,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:39,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:39,929 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:39,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,935 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-28 10:53:39,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,942 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:39,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:39,960 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:39,960 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:39,972 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:39,982 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:39,993 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,023 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:40,024 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,028 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,038 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,048 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,067 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,067 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:40,091 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:40,092 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,107 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:40,108 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:40,140 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2019-02-28 10:53:40,141 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,154 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:40,154 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:40,194 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:40,195 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,206 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:40,206 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:40,256 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-02-28 10:53:40,256 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:40,268 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:40,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2019-02-28 10:53:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:40,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:40,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:40,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-28 10:53:40,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:40,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:53:40,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:53:40,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:40,358 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-28 10:53:41,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:41,252 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-28 10:53:41,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:53:41,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-28 10:53:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:41,253 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:53:41,254 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:53:41,254 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-28 10:53:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:53:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-28 10:53:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:53:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-28 10:53:41,595 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-28 10:53:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:41,595 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-28 10:53:41,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:53:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-28 10:53:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:53:41,596 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:41,596 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:41,596 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:41,596 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-28 10:53:41,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:41,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:41,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:41,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:53:41,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:41,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:41,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-28 10:53:41,699 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-28 10:53:41,703 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:41,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:41,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:41,901 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-28 10:53:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:41,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:41,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:41,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:41,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:41,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:41,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:53:41,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:41,919 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:41,938 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:41,971 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 20 treesize of output 28 [2019-02-28 10:53:42,032 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:42,033 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:42,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:42,035 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:42,035 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,043 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,052 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,060 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,077 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:53:42,077 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,082 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,095 INFO L315 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-28 10:53:42,095 INFO L209 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-28 10:53:42,127 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2019-02-28 10:53:42,128 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:53:42,146 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-28 10:53:42,146 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:39 [2019-02-28 10:53:42,194 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 19 [2019-02-28 10:53:42,195 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,230 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 35 [2019-02-28 10:53:42,230 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,245 INFO L315 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-28 10:53:42,245 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-28 10:53:42,280 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:53:42,280 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,308 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 28 [2019-02-28 10:53:42,309 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:42,322 INFO L315 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-28 10:53:42,322 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-28 10:53:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:42,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:42,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-28 10:53:42,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:42,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:53:42,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:53:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:53:42,510 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-28 10:53:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:43,151 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-28 10:53:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:53:43,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-28 10:53:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:43,153 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:53:43,153 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:53:43,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:53:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-28 10:53:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:53:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-28 10:53:43,465 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-28 10:53:43,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:43,465 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-28 10:53:43,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:53:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-28 10:53:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:53:43,466 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:43,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:43,466 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-28 10:53:43,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:43,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:43,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:43,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:43,639 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-28 10:53:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:53:43,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:43,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:43,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:43,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:43,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:43,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:43,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:43,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:43,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:53:43,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:43,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:53:43,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:43,737 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-28 10:53:43,749 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2019-02-28 10:53:43,754 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,756 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,758 INFO L442 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 1 case distinctions, treesize of input 20 treesize of output 22 [2019-02-28 10:53:43,762 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,764 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:53:43,767 INFO L442 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 1 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:43,768 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,776 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,785 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,794 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,818 INFO L442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 10:53:43,818 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,824 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,833 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,850 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:43,850 INFO L209 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-28 10:53:43,884 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 33 [2019-02-28 10:53:43,885 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-28 10:53:43,914 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-28 10:53:43,915 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:62 [2019-02-28 10:53:43,996 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 45 [2019-02-28 10:53:43,996 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,045 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 39 [2019-02-28 10:53:44,046 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,069 INFO L315 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-28 10:53:44,070 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:56 [2019-02-28 10:53:44,134 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 37 treesize of output 42 [2019-02-28 10:53:44,135 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,165 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2019-02-28 10:53:44,166 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,188 INFO L315 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-28 10:53:44,189 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-28 10:53:44,233 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 28 [2019-02-28 10:53:44,234 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,314 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 49 [2019-02-28 10:53:44,315 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:44,337 INFO L315 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-28 10:53:44,337 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:52 [2019-02-28 10:53:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:44,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:44,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-28 10:53:44,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:44,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:53:44,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:53:44,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:53:44,449 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-28 10:53:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:45,755 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-28 10:53:45,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:53:45,755 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-28 10:53:45,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:45,756 INFO L225 Difference]: With dead ends: 186 [2019-02-28 10:53:45,757 INFO L226 Difference]: Without dead ends: 177 [2019-02-28 10:53:45,757 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-28 10:53:45,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-28 10:53:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-28 10:53:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:53:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-28 10:53:46,172 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-28 10:53:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:46,172 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-28 10:53:46,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:53:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-28 10:53:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:53:46,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:46,173 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:46,173 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:46,173 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-28 10:53:46,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:46,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:46,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:46,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:46,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:53:46,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:46,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:46,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:53:46,291 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-28 10:53:46,292 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:53:46,292 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:53:46,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:53:46,868 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-28 10:53:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:46,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:53:46,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:46,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:46,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:46,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:46,884 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:53:46,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:46,908 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:46,909 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,913 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,927 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,941 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,958 INFO L442 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-28 10:53:46,960 INFO L442 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 20 [2019-02-28 10:53:46,962 INFO L442 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 22 [2019-02-28 10:53:46,964 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:46,964 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,972 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,980 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:46,988 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:47,006 INFO L315 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-28 10:53:47,007 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:47,033 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:47,034 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:47,051 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:47,051 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:35 [2019-02-28 10:53:47,109 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 35 [2019-02-28 10:53:47,110 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:47,123 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:47,123 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-28 10:53:47,171 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:47,172 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:47,185 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:47,185 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:47,228 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 42 [2019-02-28 10:53:47,228 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:47,239 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:47,239 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-28 10:53:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:47,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:47,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:47,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-28 10:53:47,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:47,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:53:47,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:53:47,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:53:47,326 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-28 10:53:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:48,102 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-28 10:53:48,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:48,106 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-28 10:53:48,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:48,107 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:53:48,107 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:53:48,107 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-28 10:53:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:53:48,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-28 10:53:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:53:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-28 10:53:48,215 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-28 10:53:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:48,215 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-28 10:53:48,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:53:48,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-28 10:53:48,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:53:48,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:48,215 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:53:48,216 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:53:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:48,216 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-28 10:53:48,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:48,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:48,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:48,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:48,411 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-28 10:53:48,671 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-28 10:53:48,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:48,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:48,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:48,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:48,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:48,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:48,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:48,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:48,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:48,687 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:53:48,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:48,702 INFO L442 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-28 10:53:48,703 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,709 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,717 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,728 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,743 INFO L442 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-28 10:53:48,745 INFO L442 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 20 [2019-02-28 10:53:48,747 INFO L442 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 22 [2019-02-28 10:53:48,749 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-28 10:53:48,749 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,757 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,765 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,773 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,791 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,792 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-28 10:53:48,818 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-02-28 10:53:48,819 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,835 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:48,835 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-28 10:53:48,866 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 29 [2019-02-28 10:53:48,866 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,877 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:48,877 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:27 [2019-02-28 10:53:48,918 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 33 treesize of output 38 [2019-02-28 10:53:48,919 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,930 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:48,931 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-28 10:53:48,977 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 41 [2019-02-28 10:53:48,978 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:48,990 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:48,990 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-02-28 10:53:49,037 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 35 treesize of output 40 [2019-02-28 10:53:49,038 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:49,049 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 10:53:49,050 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-28 10:53:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:49,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:49,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:49,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-28 10:53:49,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:49,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:53:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:53:49,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:53:49,168 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-28 10:53:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:49,643 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-28 10:53:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:53:49,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-28 10:53:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:49,644 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:53:49,644 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:53:49,644 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-28 10:53:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:53:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:53:49,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:53:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:53:49,645 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-28 10:53:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:49,645 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:53:49,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:53:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:53:49,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:53:49,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:53:49,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:49,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:49,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:49,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:50,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:51,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:51,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:51,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:54,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:54,653 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:54,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:54,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:55,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:55,087 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:55,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:55,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:57,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:53:58,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-28 10:54:01,621 WARN L181 SmtUtils]: Spent 11.97 s on a formula simplification. DAG size of input: 1501 DAG size of output: 1063 [2019-02-28 10:54:18,510 WARN L181 SmtUtils]: Spent 16.88 s on a formula simplification. DAG size of input: 990 DAG size of output: 92 [2019-02-28 10:54:18,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:54:18,513 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-28 10:54:18,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-28 10:54:18,514 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-28 10:54:18,514 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-28 10:54:18,514 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse10 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse9 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse5 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse10 1))) (.cse21 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse15 (- 1))))) (let ((.cse18 (select .cse21 ULTIMATE.start_main_p3)) (.cse8 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse12 (<= (+ (select .cse5 ULTIMATE.start_main_p2) 1) 0)) (.cse19 (select .cse21 ULTIMATE.start_main_p1)) (.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse9 1)))) (let ((.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse7 (= .cse15 0)) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse1 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse2 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse17 (= 0 (select .cse21 ULTIMATE.start_main_p2))) (.cse16 (<= 1 .cse19)) (.cse13 (= 0 .cse19)) (.cse11 (and (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse8 (- 1))) ULTIMATE.start_main_p1)) .cse12)) (.cse20 (<= 1 .cse18)) (.cse4 (<= (+ (select .cse5 ULTIMATE.start_main_p4) 1) 0))) (or (and (and (and .cse0 .cse1 .cse2 .cse3) .cse4) (= 0 (select .cse5 ULTIMATE.start_main_p3))) (and .cse6 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) .cse7 (<= .cse8 0) (= .cse9 0) .cse3 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (<= 0 .cse10)) (let ((.cse14 (= 0 .cse18))) (or (and (and (or .cse11 (and .cse12 .cse13 .cse3)) .cse14) (<= .cse15 0)) (and (and .cse14 .cse16 .cse17 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse4))) (and (or (or (and .cse12 (and .cse1 .cse6)) .cse11) (and .cse17 (and .cse0 (<= 0 .cse19)))) .cse20 .cse7) (and (and (or (and .cse0 .cse1 .cse2) (or (and .cse17 .cse16) (or (and .cse12 .cse13) .cse11))) .cse20) .cse4)))))) [2019-02-28 10:54:18,514 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:54:18,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-28 10:54:18,515 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-28 10:54:18,515 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-28 10:54:18,515 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-28 10:54:18,533 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:54:18 BoogieIcfgContainer [2019-02-28 10:54:18,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:54:18,535 INFO L168 Benchmark]: Toolchain (without parser) took 109758.36 ms. Allocated memory was 133.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 108.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-02-28 10:54:18,535 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 133.2 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:54:18,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 133.2 MB. Free memory was 107.9 MB in the beginning and 105.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:54:18,536 INFO L168 Benchmark]: Boogie Preprocessor took 29.75 ms. Allocated memory is still 133.2 MB. Free memory was 105.7 MB in the beginning and 104.9 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. [2019-02-28 10:54:18,537 INFO L168 Benchmark]: RCFGBuilder took 285.44 ms. Allocated memory is still 133.2 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:54:18,537 INFO L168 Benchmark]: TraceAbstraction took 109377.18 ms. Allocated memory was 133.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 94.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-02-28 10:54:18,539 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.23 ms. Allocated memory is still 133.2 MB. Free memory is still 109.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 133.2 MB. Free memory was 107.9 MB in the beginning and 105.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.75 ms. Allocated memory is still 133.2 MB. Free memory was 105.7 MB in the beginning and 104.9 MB in the end (delta: 838.9 kB). Peak memory consumption was 838.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 285.44 ms. Allocated memory is still 133.2 MB. Free memory was 104.4 MB in the beginning and 94.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109377.18 ms. Allocated memory was 133.2 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 94.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: 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 - PositiveResult [Line: 39]: 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 == 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]) || (((((((((!(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])) || ((((1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) || ((#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p4] <= 0) || ((((0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0)) || (((((#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4)) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)) || (0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p4] == 0)) || (((((!(p1 == p2) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) || (0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) || (1 <= #memory_int[p2 := #memory_int[p2] + -1][p1] && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0)) && 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, 109.2s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 28.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 17.6s 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.4s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 490 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4083790413 FormulaSimplificationTreeSizeReduction, 11.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 37746182 FormulaSimplificationTreeSizeReductionInter, 16.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.6s 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...