java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:07,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:07,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:07,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:07,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:07,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:07,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:07,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:07,588 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:07,589 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:07,590 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:07,590 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:07,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:07,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:07,602 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:07,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:07,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:07,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:07,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:07,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:07,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:07,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:07,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:07,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:07,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:07,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:07,626 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:07,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:07,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:07,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:07,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:07,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:07,632 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:07,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:07,633 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:07,633 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:07,634 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-18 09:38:07,657 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:07,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:07,659 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:07,659 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:07,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:07,659 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:07,660 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:07,660 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:07,660 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:07,660 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:07,661 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:07,661 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:07,661 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:07,661 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:07,662 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:07,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:07,662 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:07,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:07,663 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:07,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:07,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:07,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:07,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:07,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:07,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:07,664 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:07,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:07,664 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:07,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:07,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:07,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:07,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:07,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:07,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:07,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:07,666 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:07,666 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:07,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:07,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:07,667 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:07,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:07,706 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:07,709 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:07,710 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:07,710 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:07,711 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-18 09:38:07,711 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-unlimited.bpl' [2019-02-18 09:38:07,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:07,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:07,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:07,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:07,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:07,771 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,784 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:07,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:07,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:07,815 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:07,827 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,828 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,829 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,829 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,835 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,840 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,841 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 18.02 09:38:07" (1/1) ... [2019-02-18 09:38:07,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:07,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:07,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:07,844 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:07,845 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 18.02 09:38:07" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:08,152 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:08,153 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-02-18 09:38:08,154 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:08 BoogieIcfgContainer [2019-02-18 09:38:08,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:08,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:08,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:08,159 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:08,159 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 18.02 09:38:07" (1/2) ... [2019-02-18 09:38:08,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a6ba12b and model type speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:08, skipping insertion in model container [2019-02-18 09:38:08,160 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 18.02 09:38:08" (2/2) ... [2019-02-18 09:38:08,162 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-unlimited.bpl [2019-02-18 09:38:08,172 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:08,181 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-02-18 09:38:08,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-02-18 09:38:08,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:08,235 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:08,236 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:08,236 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:08,236 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:08,237 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:08,237 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:08,237 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-02-18 09:38:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:08,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:08,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:08,278 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:08,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-02-18 09:38:08,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:08,490 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-18 09:38:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:08,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:08,493 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:08,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:08,510 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-02-18 09:38:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:08,747 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-02-18 09:38:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:08,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:08,765 INFO L225 Difference]: With dead ends: 21 [2019-02-18 09:38:08,765 INFO L226 Difference]: Without dead ends: 16 [2019-02-18 09:38:08,768 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-18 09:38:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-18 09:38:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-02-18 09:38:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:38:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-02-18 09:38:08,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-02-18 09:38:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:08,806 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-02-18 09:38:08,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-02-18 09:38:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:08,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:08,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:08,808 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:08,809 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-02-18 09:38:08,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:08,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:08,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:08,930 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-18 09:38:08,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:08,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:08,932 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:08,934 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-02-18 09:38:08,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:08,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:09,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:09,049 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:09,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:09,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:09,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:09,054 INFO 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-18 09:38:09,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:09,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:09,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:09,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:09,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:09,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:09,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:09,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:09,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:09,902 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-18 09:38:09,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:09,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:09,942 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,952 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,969 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:10,024 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:10,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:10,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:10,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:10,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:10,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:10,186 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-18 09:38:10,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:10,263 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-18 09:38:10,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:10,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:10,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:10,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:10,285 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2019-02-18 09:38:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:10,840 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2019-02-18 09:38:10,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:10,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:10,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:10,842 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:38:10,842 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:38:10,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:38:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:38:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 13. [2019-02-18 09:38:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:38:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-02-18 09:38:10,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-02-18 09:38:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:10,851 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-02-18 09:38:10,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-02-18 09:38:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:10,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:10,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:10,852 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-02-18 09:38:10,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:10,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:10,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:10,884 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-18 09:38:10,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:10,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:10,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:10,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:10,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:10,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:10,886 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-02-18 09:38:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:10,920 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-02-18 09:38:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:10,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:38:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:10,922 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:38:10,922 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:38:10,923 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-18 09:38:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:38:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-18 09:38:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:38:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-02-18 09:38:10,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-02-18 09:38:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:10,929 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-02-18 09:38:10,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-02-18 09:38:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:10,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:10,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:10,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-02-18 09:38:10,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:10,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:10,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:10,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,001 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-18 09:38:11,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:11,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:11,002 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-02-18 09:38:11,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:11,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:11,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:11,010 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:11,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:11,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:11,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:11,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:11,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:11,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:11,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:11,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:38:11,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-18 09:38:11,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:11,332 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:35, output treesize:33 [2019-02-18 09:38:11,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:11,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:11,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:11,414 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-18 09:38:11,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:11,456 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-18 09:38:11,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:11,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:38:11,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:11,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:11,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:11,476 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 4 states. [2019-02-18 09:38:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:11,567 INFO L93 Difference]: Finished difference Result 18 states and 41 transitions. [2019-02-18 09:38:11,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:38:11,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:38:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:11,568 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:38:11,568 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:38:11,569 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-18 09:38:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:38:11,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-18 09:38:11,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:38:11,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 40 transitions. [2019-02-18 09:38:11,574 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 40 transitions. Word has length 3 [2019-02-18 09:38:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:11,575 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 40 transitions. [2019-02-18 09:38:11,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 40 transitions. [2019-02-18 09:38:11,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:11,575 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:11,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:11,576 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,576 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-02-18 09:38:11,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:11,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:11,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,631 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-18 09:38:11,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:11,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:11,632 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-02-18 09:38:11,633 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:11,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:11,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:11,639 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 44 root evaluator evaluations with a maximum evaluation depth of 2. Performed 44 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:11,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:11,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:11,640 INFO 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-18 09:38:11,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:11,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:11,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:11,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:38:11,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-18 09:38:11,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:11,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:11,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:11,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:11,821 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,870 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:11,907 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-18 09:38:11,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:11,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:38:11,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:11,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:11,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:11,990 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-18 09:38:11,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:12,001 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-18 09:38:12,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:12,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:12,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:12,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:12,023 INFO L87 Difference]: Start difference. First operand 16 states and 40 transitions. Second operand 6 states. [2019-02-18 09:38:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:12,190 INFO L93 Difference]: Finished difference Result 32 states and 62 transitions. [2019-02-18 09:38:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:12,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:38:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:12,192 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:38:12,193 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:38:12,193 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-18 09:38:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:38:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2019-02-18 09:38:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:38:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 50 transitions. [2019-02-18 09:38:12,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 50 transitions. Word has length 3 [2019-02-18 09:38:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:12,200 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 50 transitions. [2019-02-18 09:38:12,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 50 transitions. [2019-02-18 09:38:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:12,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:12,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:12,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-02-18 09:38:12,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,303 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-18 09:38:12,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:12,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:12,304 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-02-18 09:38:12,307 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:12,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:12,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:12,317 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:12,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,318 INFO 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-18 09:38:12,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:12,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:12,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:12,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:12,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:12,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:12,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:12,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:12,539 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,571 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,580 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:12,641 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:12,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:12,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:12,720 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-18 09:38:12,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:12,749 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-18 09:38:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:12,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 09:38:12,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:12,768 INFO L87 Difference]: Start difference. First operand 18 states and 50 transitions. Second operand 4 states. [2019-02-18 09:38:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:12,801 INFO L93 Difference]: Finished difference Result 22 states and 58 transitions. [2019-02-18 09:38:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:12,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:38:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:12,802 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:38:12,802 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:38:12,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:38:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:38:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-18 09:38:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:38:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2019-02-18 09:38:12,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 57 transitions. Word has length 4 [2019-02-18 09:38:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:12,809 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 57 transitions. [2019-02-18 09:38:12,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 57 transitions. [2019-02-18 09:38:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:12,810 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:12,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:12,810 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-02-18 09:38:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:12,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:12,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,886 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-18 09:38:12,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:12,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:12,887 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-02-18 09:38:12,889 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:12,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:12,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:12,894 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:12,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:12,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:12,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:12,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:12,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:12,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:12,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:12,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:12,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:12,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:12,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:12,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:12,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:12,997 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:13,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:13,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,206 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-02-18 09:38:13,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:13,207 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:13,249 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:13,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:13,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:13,639 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:13,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 09:38:13,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:13,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:13,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-18 09:38:13,679 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-18 09:38:13,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:13,739 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-18 09:38:13,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:13,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:13,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:13,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:13,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:13,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:13,760 INFO L87 Difference]: Start difference. First operand 20 states and 57 transitions. Second operand 8 states. [2019-02-18 09:38:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:14,227 INFO L93 Difference]: Finished difference Result 37 states and 74 transitions. [2019-02-18 09:38:14,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:14,228 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:14,229 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:38:14,229 INFO L226 Difference]: Without dead ends: 36 [2019-02-18 09:38:14,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-18 09:38:14,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 17. [2019-02-18 09:38:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 41 transitions. [2019-02-18 09:38:14,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 41 transitions. Word has length 4 [2019-02-18 09:38:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:14,237 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 41 transitions. [2019-02-18 09:38:14,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:14,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 41 transitions. [2019-02-18 09:38:14,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:14,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:14,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:14,238 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:14,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,238 INFO L82 PathProgramCache]: Analyzing trace with hash 939350, now seen corresponding path program 1 times [2019-02-18 09:38:14,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:14,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:14,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,354 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-18 09:38:14,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:14,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:14,355 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-02-18 09:38:14,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:14,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:14,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:14,362 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:14,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:14,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:14,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:14,363 INFO 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-18 09:38:14,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:14,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:14,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:14,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:14,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:14,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:14,537 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:14,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:14,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:14,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:14,619 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,652 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:14,688 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:14,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:14,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:14,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:14,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:14,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:14,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:14,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:14,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:14,859 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-18 09:38:14,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:14,898 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-18 09:38:14,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:14,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:14,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:14,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:14,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:14,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:14,918 INFO L87 Difference]: Start difference. First operand 17 states and 41 transitions. Second operand 8 states. [2019-02-18 09:38:15,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:15,349 INFO L93 Difference]: Finished difference Result 46 states and 87 transitions. [2019-02-18 09:38:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:15,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:15,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:15,351 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:38:15,351 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:38:15,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:38:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-18 09:38:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:38:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-02-18 09:38:15,365 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-02-18 09:38:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:15,365 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-02-18 09:38:15,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-02-18 09:38:15,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:15,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:15,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:15,367 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:15,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:15,367 INFO L82 PathProgramCache]: Analyzing trace with hash 929802, now seen corresponding path program 1 times [2019-02-18 09:38:15,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:15,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:15,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:15,499 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-18 09:38:15,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:15,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:15,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:15,500 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-02-18 09:38:15,501 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:15,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:15,506 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:15,506 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:15,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:15,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:15,507 INFO 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-18 09:38:15,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:15,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:15,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:15,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:15,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:15,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:15,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:15,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:15,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:15,790 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,816 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:15,845 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:15,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:15,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:15,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:15,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:15,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:15,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:15,952 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-18 09:38:15,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:15,967 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-18 09:38:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:15,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:15,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:15,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:15,988 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-02-18 09:38:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:16,198 INFO L93 Difference]: Finished difference Result 52 states and 124 transitions. [2019-02-18 09:38:16,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:16,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:16,200 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:38:16,200 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:38:16,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:38:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2019-02-18 09:38:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:38:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 78 transitions. [2019-02-18 09:38:16,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 78 transitions. Word has length 4 [2019-02-18 09:38:16,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:16,210 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 78 transitions. [2019-02-18 09:38:16,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 78 transitions. [2019-02-18 09:38:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:16,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:16,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:16,212 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:16,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:16,212 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-02-18 09:38:16,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:16,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:16,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:16,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:16,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:16,250 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-18 09:38:16,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:16,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:16,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:16,251 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-02-18 09:38:16,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:16,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:16,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:16,257 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:16,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:16,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:16,257 INFO 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-18 09:38:16,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:16,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:16,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:16,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:38:16,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-18 09:38:16,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:16,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:16,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:16,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:16,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,389 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:16,421 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:35, output treesize:33 [2019-02-18 09:38:16,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:16,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:16,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:16,501 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-18 09:38:16,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:16,569 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-18 09:38:16,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:16,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:16,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:16,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:16,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:16,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:16,589 INFO L87 Difference]: Start difference. First operand 26 states and 78 transitions. Second operand 6 states. [2019-02-18 09:38:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:16,829 INFO L93 Difference]: Finished difference Result 36 states and 91 transitions. [2019-02-18 09:38:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:16,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:16,833 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:38:16,833 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:38:16,833 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-18 09:38:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:38:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-02-18 09:38:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:38:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 84 transitions. [2019-02-18 09:38:16,842 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 84 transitions. Word has length 4 [2019-02-18 09:38:16,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:16,843 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 84 transitions. [2019-02-18 09:38:16,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:16,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 84 transitions. [2019-02-18 09:38:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:16,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:16,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:16,844 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:16,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash 933584, now seen corresponding path program 1 times [2019-02-18 09:38:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:16,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:16,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:16,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:16,908 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:16,908 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-02-18 09:38:16,910 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:16,910 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:16,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:16,914 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:16,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:16,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:16,915 INFO 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-18 09:38:16,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:16,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:16,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:16,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:16,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:16,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:16,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:16,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:16,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:16,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:17,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:17,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:17,137 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,145 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:17,174 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:17,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:17,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:17,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:17,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:17,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:17,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:17,324 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-18 09:38:17,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:17,345 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-18 09:38:17,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:17,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:17,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:17,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:17,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:17,366 INFO L87 Difference]: Start difference. First operand 28 states and 84 transitions. Second operand 8 states. [2019-02-18 09:38:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:17,741 INFO L93 Difference]: Finished difference Result 52 states and 123 transitions. [2019-02-18 09:38:17,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:17,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:38:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:17,743 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:38:17,743 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:38:17,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:38:17,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2019-02-18 09:38:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:38:17,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 99 transitions. [2019-02-18 09:38:17,754 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 99 transitions. Word has length 4 [2019-02-18 09:38:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:17,754 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 99 transitions. [2019-02-18 09:38:17,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 99 transitions. [2019-02-18 09:38:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:38:17,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:17,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:38:17,755 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:17,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-02-18 09:38:17,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:17,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:17,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:17,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:17,800 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-18 09:38:17,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:17,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:17,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:38:17,801 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-02-18 09:38:17,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:17,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:17,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:17,806 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 2. Performed 46 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:17,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:17,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:17,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:17,807 INFO 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-18 09:38:17,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:17,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:17,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:17,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:17,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:17,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:38:17,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:38:17,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,933 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:17,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:17,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:17,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:18,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:18,018 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,026 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,063 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:41, output treesize:41 [2019-02-18 09:38:18,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2019-02-18 09:38:18,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-18 09:38:18,156 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-18 09:38:18,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:18,164 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-18 09:38:18,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:18,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:18,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:18,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:18,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:18,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:18,185 INFO L87 Difference]: Start difference. First operand 31 states and 99 transitions. Second operand 6 states. [2019-02-18 09:38:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:18,371 INFO L93 Difference]: Finished difference Result 39 states and 105 transitions. [2019-02-18 09:38:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:18,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 09:38:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:18,372 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:38:18,372 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:38:18,373 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-18 09:38:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:38:18,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-02-18 09:38:18,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:38:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 97 transitions. [2019-02-18 09:38:18,385 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 97 transitions. Word has length 4 [2019-02-18 09:38:18,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:18,385 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 97 transitions. [2019-02-18 09:38:18,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:38:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 97 transitions. [2019-02-18 09:38:18,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:18,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:18,386 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:38:18,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:18,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:18,387 INFO L82 PathProgramCache]: Analyzing trace with hash 29121388, now seen corresponding path program 2 times [2019-02-18 09:38:18,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:18,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:18,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:18,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:18,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:18,442 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-18 09:38:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:18,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:18,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:18,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:18,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:18,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 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-18 09:38:18,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:18,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:18,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:18,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:18,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:18,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:18,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:18,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,566 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:18,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:18,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:18,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:18,605 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,619 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,627 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,654 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:18,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 09:38:18,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:33 [2019-02-18 09:38:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:18,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:18,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:18,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:18,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:18,797 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-18 09:38:18,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:18,823 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-18 09:38:18,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:18,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:38:18,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:18,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:18,843 INFO L87 Difference]: Start difference. First operand 30 states and 97 transitions. Second operand 9 states. [2019-02-18 09:38:19,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:19,207 INFO L93 Difference]: Finished difference Result 65 states and 148 transitions. [2019-02-18 09:38:19,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:19,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:38:19,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:19,209 INFO L225 Difference]: With dead ends: 65 [2019-02-18 09:38:19,209 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 09:38:19,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:19,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 09:38:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 32. [2019-02-18 09:38:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:38:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-18 09:38:19,221 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-18 09:38:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:19,221 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-18 09:38:19,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-18 09:38:19,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:19,222 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:19,222 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:38:19,222 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:19,223 INFO L82 PathProgramCache]: Analyzing trace with hash 29121636, now seen corresponding path program 2 times [2019-02-18 09:38:19,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:19,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:19,393 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-18 09:38:19,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:19,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:19,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:19,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:19,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:19,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:19,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:19,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:19,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:19,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:19,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:19,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:19,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:19,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,487 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:19,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:19,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:19,593 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,603 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,612 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:19,631 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:19,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:19,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:19,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 09:38:19,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:19,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 09:38:19,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:19,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:19,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:19,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:19,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:19,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:19,862 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-18 09:38:19,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:19,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 09:38:19,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:19,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:19,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:19,882 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 9 states. [2019-02-18 09:38:20,103 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-02-18 09:38:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:20,342 INFO L93 Difference]: Finished difference Result 53 states and 146 transitions. [2019-02-18 09:38:20,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:20,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:38:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:20,344 INFO L225 Difference]: With dead ends: 53 [2019-02-18 09:38:20,344 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:38:20,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:20,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:38:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2019-02-18 09:38:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:38:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 106 transitions. [2019-02-18 09:38:20,356 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 106 transitions. Word has length 5 [2019-02-18 09:38:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:20,356 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 106 transitions. [2019-02-18 09:38:20,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 106 transitions. [2019-02-18 09:38:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:20,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:20,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:20,357 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash 29112214, now seen corresponding path program 1 times [2019-02-18 09:38:20,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:20,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:20,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:20,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:20,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:20,414 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-18 09:38:20,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:20,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:20,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:20,415 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [21] [2019-02-18 09:38:20,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:20,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:20,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:20,420 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:20,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:20,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:20,421 INFO 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-18 09:38:20,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:20,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:20,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:20,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:20,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,569 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:20,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:20,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:20,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:20,604 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,617 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:20,651 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:20,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:20,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:20,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:20,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:20,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:20,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:20,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:20,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:20,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:20,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:20,787 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-18 09:38:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:20,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:20,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:20,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:20,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:20,807 INFO L87 Difference]: Start difference. First operand 32 states and 106 transitions. Second operand 8 states. [2019-02-18 09:38:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:21,045 INFO L93 Difference]: Finished difference Result 54 states and 147 transitions. [2019-02-18 09:38:21,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:21,045 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:21,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:21,046 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:38:21,047 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:38:21,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:38:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-02-18 09:38:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:38:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 122 transitions. [2019-02-18 09:38:21,059 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 122 transitions. Word has length 5 [2019-02-18 09:38:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:21,059 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 122 transitions. [2019-02-18 09:38:21,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 122 transitions. [2019-02-18 09:38:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:21,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:21,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:21,060 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:21,061 INFO L82 PathProgramCache]: Analyzing trace with hash 29115622, now seen corresponding path program 1 times [2019-02-18 09:38:21,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:21,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:21,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:21,194 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-18 09:38:21,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:21,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:21,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:21,195 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-02-18 09:38:21,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:21,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:21,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:21,201 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:21,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:21,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:21,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:21,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:21,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:21,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:21,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:21,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:21,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:21,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:21,261 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:38:21,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-18 09:38:21,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,388 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:21,405 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-18 09:38:21,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:21,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 09:38:21,602 INFO L267 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-18 09:38:21,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:108 [2019-02-18 09:38:21,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,723 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:21,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 09:38:21,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 44 [2019-02-18 09:38:21,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,844 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:21,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2019-02-18 09:38:21,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,876 INFO L267 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-18 09:38:21,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:105, output treesize:61 [2019-02-18 09:38:21,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 44 [2019-02-18 09:38:21,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:21,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:21,983 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:21,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2019-02-18 09:38:21,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:22,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:22,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 54 [2019-02-18 09:38:22,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:22,061 INFO L267 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-18 09:38:22,061 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:101, output treesize:65 [2019-02-18 09:38:22,098 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-18 09:38:22,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:22,112 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-18 09:38:22,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:22,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2019-02-18 09:38:22,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:22,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:22,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:22,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:22,131 INFO L87 Difference]: Start difference. First operand 35 states and 122 transitions. Second operand 10 states. [2019-02-18 09:38:22,826 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 39 [2019-02-18 09:38:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:23,473 INFO L93 Difference]: Finished difference Result 81 states and 236 transitions. [2019-02-18 09:38:23,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:38:23,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:23,475 INFO L225 Difference]: With dead ends: 81 [2019-02-18 09:38:23,475 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:38:23,476 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-18 09:38:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:38:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 40. [2019-02-18 09:38:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:38:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 148 transitions. [2019-02-18 09:38:23,491 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 148 transitions. Word has length 5 [2019-02-18 09:38:23,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:23,491 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 148 transitions. [2019-02-18 09:38:23,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 148 transitions. [2019-02-18 09:38:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:23,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:23,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:23,495 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 29115870, now seen corresponding path program 1 times [2019-02-18 09:38:23,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:23,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:23,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:23,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:23,648 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 09:38:23,837 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-18 09:38:23,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:23,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:23,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:23,838 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [19] [2019-02-18 09:38:23,838 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:23,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:23,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:23,842 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:23,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:23,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:23,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:23,843 INFO 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-18 09:38:23,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:23,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:23,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:23,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:23,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:23,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:23,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:23,897 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:23,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:23,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:23,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:24,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:24,032 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,041 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,068 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:24,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:24,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:24,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:24,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,203 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:24,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 09:38:24,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:24,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:29 [2019-02-18 09:38:24,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 69 [2019-02-18 09:38:24,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:24,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:24,297 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-18 09:38:24,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:24,335 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-18 09:38:24,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:24,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:24,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:24,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:24,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:24,355 INFO L87 Difference]: Start difference. First operand 40 states and 148 transitions. Second operand 10 states. [2019-02-18 09:38:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:24,741 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-18 09:38:24,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:24,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:24,743 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:38:24,743 INFO L226 Difference]: Without dead ends: 64 [2019-02-18 09:38:24,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-18 09:38:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 41. [2019-02-18 09:38:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:38:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 152 transitions. [2019-02-18 09:38:24,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 152 transitions. Word has length 5 [2019-02-18 09:38:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:24,760 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 152 transitions. [2019-02-18 09:38:24,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 152 transitions. [2019-02-18 09:38:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:24,761 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:24,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:24,761 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29119902, now seen corresponding path program 1 times [2019-02-18 09:38:24,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:24,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:24,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,843 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-18 09:38:24,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:24,844 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:24,844 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [21] [2019-02-18 09:38:24,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:24,846 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:24,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:24,850 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:24,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:24,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:24,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:24,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:24,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:24,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:24,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:24,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:24,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:24,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:25,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:25,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:38:25,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:38:25,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,307 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:25,474 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 09:38:25,849 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 18 [2019-02-18 09:38:25,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:25,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:25,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:26,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:26,232 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:38:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:26,342 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-02-18 09:38:26,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:38:26,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:26,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:26,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-18 09:38:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:26,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:26,597 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-18 09:38:26,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:26,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:26,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:26,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:26,617 INFO L87 Difference]: Start difference. First operand 41 states and 152 transitions. Second operand 8 states. [2019-02-18 09:38:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:26,853 INFO L93 Difference]: Finished difference Result 62 states and 176 transitions. [2019-02-18 09:38:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:26,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:26,855 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:38:26,855 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:38:26,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:38:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-02-18 09:38:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:38:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 137 transitions. [2019-02-18 09:38:26,871 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 137 transitions. Word has length 5 [2019-02-18 09:38:26,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:26,871 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 137 transitions. [2019-02-18 09:38:26,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 137 transitions. [2019-02-18 09:38:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:26,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:26,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:26,872 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:26,873 INFO L82 PathProgramCache]: Analyzing trace with hash 28827822, now seen corresponding path program 1 times [2019-02-18 09:38:26,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:26,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:26,996 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-18 09:38:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:26,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:38:26,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:26,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:26,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:26,998 INFO L87 Difference]: Start difference. First operand 38 states and 137 transitions. Second operand 4 states. [2019-02-18 09:38:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:27,055 INFO L93 Difference]: Finished difference Result 51 states and 158 transitions. [2019-02-18 09:38:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:38:27,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 09:38:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:27,056 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:38:27,056 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:38:27,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:38:27,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:38:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-02-18 09:38:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:38:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 145 transitions. [2019-02-18 09:38:27,071 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 145 transitions. Word has length 5 [2019-02-18 09:38:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:27,071 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 145 transitions. [2019-02-18 09:38:27,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 145 transitions. [2019-02-18 09:38:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:27,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:27,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:27,072 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:27,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 28818022, now seen corresponding path program 2 times [2019-02-18 09:38:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:27,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:27,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:27,174 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-18 09:38:27,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:27,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:27,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:27,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:27,175 INFO 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-18 09:38:27,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:27,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:27,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:27,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:27,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:27,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:27,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:27,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:27,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:27,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:27,708 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 09:38:27,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:27,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:27,748 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,767 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:27,785 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:27,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:27,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:27,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 09:38:27,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:27,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:27,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:27,966 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:27,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-18 09:38:27,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:28,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:28,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:28,258 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-18 09:38:28,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:28,742 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-18 09:38:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:28,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:28,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:28,798 INFO L87 Difference]: Start difference. First operand 39 states and 145 transitions. Second operand 10 states. [2019-02-18 09:38:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:29,880 INFO L93 Difference]: Finished difference Result 90 states and 270 transitions. [2019-02-18 09:38:29,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:29,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 09:38:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:29,882 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:38:29,882 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:38:29,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:38:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2019-02-18 09:38:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:38:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 178 transitions. [2019-02-18 09:38:29,902 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 178 transitions. Word has length 5 [2019-02-18 09:38:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:29,902 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 178 transitions. [2019-02-18 09:38:29,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 178 transitions. [2019-02-18 09:38:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:29,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:29,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:29,903 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash 28818148, now seen corresponding path program 1 times [2019-02-18 09:38:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:29,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:29,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:29,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:29,938 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [21] [2019-02-18 09:38:29,939 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:29,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:29,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:29,943 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:29,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:29,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:29,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:29,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:29,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:29,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:29,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:29,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:29,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:29,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:29,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:30,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:30,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:30,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:30,120 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,149 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,158 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:30,178 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:30,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:30,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:30,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:30,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:30,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:30,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:30,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:30,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:30,616 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-18 09:38:30,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:30,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:30,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:30,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:30,648 INFO L87 Difference]: Start difference. First operand 47 states and 178 transitions. Second operand 8 states. [2019-02-18 09:38:30,813 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-02-18 09:38:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,925 INFO L93 Difference]: Finished difference Result 66 states and 232 transitions. [2019-02-18 09:38:30,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:30,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,926 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:38:30,927 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:38:30,927 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-18 09:38:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:38:30,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2019-02-18 09:38:30,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:38:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 209 transitions. [2019-02-18 09:38:30,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 209 transitions. Word has length 5 [2019-02-18 09:38:30,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,953 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 209 transitions. [2019-02-18 09:38:30,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 209 transitions. [2019-02-18 09:38:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:30,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:30,954 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,954 INFO L82 PathProgramCache]: Analyzing trace with hash 28821992, now seen corresponding path program 1 times [2019-02-18 09:38:30,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:30,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,019 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-18 09:38:31,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:31,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:38:31,019 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [21] [2019-02-18 09:38:31,020 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:31,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:31,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:31,024 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:31,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:31,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:31,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:31,025 INFO 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-18 09:38:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:31,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:31,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:31,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:31,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:31,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:31,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:31,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:31,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:31,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:31,164 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,187 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:31,214 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:31,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:31,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:31,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:31,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:31,509 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:31,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-18 09:38:31,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:31,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:31,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:31,564 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-18 09:38:31,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:31,594 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-18 09:38:31,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:31,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-18 09:38:31,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:38:31,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:38:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:31,615 INFO L87 Difference]: Start difference. First operand 53 states and 209 transitions. Second operand 7 states. [2019-02-18 09:38:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:31,901 INFO L93 Difference]: Finished difference Result 63 states and 221 transitions. [2019-02-18 09:38:31,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:31,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-18 09:38:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:31,904 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:38:31,904 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 09:38:31,905 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-18 09:38:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 09:38:31,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 52. [2019-02-18 09:38:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:38:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 207 transitions. [2019-02-18 09:38:31,923 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 207 transitions. Word has length 5 [2019-02-18 09:38:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:31,923 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 207 transitions. [2019-02-18 09:38:31,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:38:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 207 transitions. [2019-02-18 09:38:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:38:31,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:31,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 09:38:31,924 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash 28933468, now seen corresponding path program 2 times [2019-02-18 09:38:31,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:31,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:31,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:31,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:32,123 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-18 09:38:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:32,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:32,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:32,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:32,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:32,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:32,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:32,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:38:32,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:32,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:32,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:32,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:32,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:32,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:32,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:32,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:32,303 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,317 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,336 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:32,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:32,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:32,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:32,427 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-18 09:38:32,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:32,446 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-18 09:38:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:32,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:32,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:32,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:32,466 INFO L87 Difference]: Start difference. First operand 52 states and 207 transitions. Second operand 8 states. [2019-02-18 09:38:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:32,657 INFO L93 Difference]: Finished difference Result 86 states and 292 transitions. [2019-02-18 09:38:32,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:32,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 09:38:32,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:32,659 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:38:32,659 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:38:32,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:32,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:38:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2019-02-18 09:38:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:38:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 254 transitions. [2019-02-18 09:38:32,685 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 254 transitions. Word has length 5 [2019-02-18 09:38:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:32,685 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 254 transitions. [2019-02-18 09:38:32,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 254 transitions. [2019-02-18 09:38:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:32,686 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:32,686 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-18 09:38:32,686 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:32,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 902762954, now seen corresponding path program 3 times [2019-02-18 09:38:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:32,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:32,806 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-18 09:38:32,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:32,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:32,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:32,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:32,806 INFO 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-18 09:38:32,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:32,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:32,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:32,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:32,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:32,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:32,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:32,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:32,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:32,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,902 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:32,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:32,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:32,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:32,934 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:32,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:32,985 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:33,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:33,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 09:38:33,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 09:38:33,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:33,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:33,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:33,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:33,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:33,177 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-18 09:38:33,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:33,216 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-18 09:38:33,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:33,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2019-02-18 09:38:33,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:33,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:33,242 INFO L87 Difference]: Start difference. First operand 61 states and 254 transitions. Second operand 10 states. [2019-02-18 09:38:33,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:33,663 INFO L93 Difference]: Finished difference Result 96 states and 318 transitions. [2019-02-18 09:38:33,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:33,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:33,665 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:38:33,666 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:38:33,666 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-18 09:38:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:38:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 66. [2019-02-18 09:38:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:38:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 276 transitions. [2019-02-18 09:38:33,689 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 276 transitions. Word has length 6 [2019-02-18 09:38:33,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:33,689 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 276 transitions. [2019-02-18 09:38:33,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 276 transitions. [2019-02-18 09:38:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:33,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:33,690 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:38:33,690 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:33,690 INFO L82 PathProgramCache]: Analyzing trace with hash 902762768, now seen corresponding path program 3 times [2019-02-18 09:38:33,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:33,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:33,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:33,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:33,799 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-18 09:38:33,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:33,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:33,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:33,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:33,800 INFO 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-18 09:38:33,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:33,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:33,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:33,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:33,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:33,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:33,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:33,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:33,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:33,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:33,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:34,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:34,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:34,007 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,021 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,035 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,052 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:34,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:34,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:34,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-02-18 09:38:34,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:33 [2019-02-18 09:38:34,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:34,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:34,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:34,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 09:38:34,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:34,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:34,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 09:38:34,350 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-18 09:38:34,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:34,438 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-18 09:38:34,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:34,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:34,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:34,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:34,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:34,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:34,458 INFO L87 Difference]: Start difference. First operand 66 states and 276 transitions. Second operand 11 states. [2019-02-18 09:38:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:34,893 INFO L93 Difference]: Finished difference Result 107 states and 377 transitions. [2019-02-18 09:38:34,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:34,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:38:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:34,895 INFO L225 Difference]: With dead ends: 107 [2019-02-18 09:38:34,896 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:38:34,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:38:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:38:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2019-02-18 09:38:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:38:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 321 transitions. [2019-02-18 09:38:34,924 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 321 transitions. Word has length 6 [2019-02-18 09:38:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:34,925 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 321 transitions. [2019-02-18 09:38:34,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 321 transitions. [2019-02-18 09:38:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:34,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:34,926 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:38:34,926 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 902474468, now seen corresponding path program 4 times [2019-02-18 09:38:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:34,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,231 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-18 09:38:35,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:35,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:35,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:35,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,232 INFO 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-18 09:38:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:35,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:35,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:35,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:35,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:35,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:35,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,300 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:35,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:35,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:35,386 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,404 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,421 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:35,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:35,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:35,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:35,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:35,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:35,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 09:38:35,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:35,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:35,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 09:38:35,673 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-18 09:38:35,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:35,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:35,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:35,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:35,742 INFO L87 Difference]: Start difference. First operand 75 states and 321 transitions. Second operand 11 states. [2019-02-18 09:38:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:36,161 INFO L93 Difference]: Finished difference Result 116 states and 391 transitions. [2019-02-18 09:38:36,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:36,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:38:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:36,163 INFO L225 Difference]: With dead ends: 116 [2019-02-18 09:38:36,163 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:38:36,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:38:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:38:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 51. [2019-02-18 09:38:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:38:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 198 transitions. [2019-02-18 09:38:36,187 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 198 transitions. Word has length 6 [2019-02-18 09:38:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:36,188 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 198 transitions. [2019-02-18 09:38:36,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 198 transitions. [2019-02-18 09:38:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:36,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:36,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:36,188 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,189 INFO L82 PathProgramCache]: Analyzing trace with hash 902478688, now seen corresponding path program 1 times [2019-02-18 09:38:36,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:36,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,260 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-18 09:38:36,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:36,261 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:36,262 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [23] [2019-02-18 09:38:36,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:36,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:36,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:36,267 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:36,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:36,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:36,268 INFO 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-18 09:38:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:36,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:36,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:36,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:36,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:36,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:36,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:36,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:36,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:36,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:36,447 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,464 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:36,483 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:36,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:36,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:36,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:36,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:36,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:36,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:36,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:36,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:36,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:36,629 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-18 09:38:36,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:36,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:36,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:36,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:36,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:36,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:36,649 INFO L87 Difference]: Start difference. First operand 51 states and 198 transitions. Second operand 8 states. [2019-02-18 09:38:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:36,975 INFO L93 Difference]: Finished difference Result 72 states and 235 transitions. [2019-02-18 09:38:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:36,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:36,976 INFO L225 Difference]: With dead ends: 72 [2019-02-18 09:38:36,976 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:38:36,977 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-18 09:38:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:38:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2019-02-18 09:38:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:38:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 214 transitions. [2019-02-18 09:38:37,001 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 214 transitions. Word has length 6 [2019-02-18 09:38:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,001 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 214 transitions. [2019-02-18 09:38:37,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 214 transitions. [2019-02-18 09:38:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:37,002 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:37,002 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 902469014, now seen corresponding path program 1 times [2019-02-18 09:38:37,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:37,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:37,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:37,086 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [21] [2019-02-18 09:38:37,087 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:37,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:37,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:37,091 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:37,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:37,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:37,091 INFO 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-18 09:38:37,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:37,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:37,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:37,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:37,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:37,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:37,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:37,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:37,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:37,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:37,271 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:37,307 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:37,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:37,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:37,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:37,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:37,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,425 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:37,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:37,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:38:37,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:37,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:37,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:37,472 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-18 09:38:37,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:37,494 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-18 09:38:37,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:37,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:37,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:37,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:37,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:37,515 INFO L87 Difference]: Start difference. First operand 55 states and 214 transitions. Second operand 10 states. [2019-02-18 09:38:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:37,876 INFO L93 Difference]: Finished difference Result 77 states and 249 transitions. [2019-02-18 09:38:37,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:37,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:37,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:37,878 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:38:37,878 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 09:38:37,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 09:38:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-18 09:38:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:38:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 213 transitions. [2019-02-18 09:38:37,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 213 transitions. Word has length 6 [2019-02-18 09:38:37,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,909 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 213 transitions. [2019-02-18 09:38:37,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 213 transitions. [2019-02-18 09:38:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:37,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,910 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:37,910 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash 902472858, now seen corresponding path program 1 times [2019-02-18 09:38:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:37,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,039 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-18 09:38:38,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:38,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:38,040 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [21] [2019-02-18 09:38:38,041 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:38,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:38,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:38,045 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:38,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:38,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:38,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:38,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:38,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:38,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:38,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:38,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:38,237 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,272 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:38,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:38,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:38,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:38,497 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:38,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:38,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:38,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:38,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:38,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:38,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:38,574 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-18 09:38:38,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:38,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:38,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:38,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:38,593 INFO L87 Difference]: Start difference. First operand 55 states and 213 transitions. Second operand 10 states. [2019-02-18 09:38:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:38,920 INFO L93 Difference]: Finished difference Result 78 states and 272 transitions. [2019-02-18 09:38:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:38,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:38,921 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:38:38,921 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:38:38,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:38:38,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 59. [2019-02-18 09:38:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:38:38,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 238 transitions. [2019-02-18 09:38:38,954 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 238 transitions. Word has length 6 [2019-02-18 09:38:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:38,954 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 238 transitions. [2019-02-18 09:38:38,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:38,954 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 238 transitions. [2019-02-18 09:38:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:38,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:38,955 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:38:38,955 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:38,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:38,955 INFO L82 PathProgramCache]: Analyzing trace with hash 902712672, now seen corresponding path program 1 times [2019-02-18 09:38:38,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:38,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:38,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,029 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-18 09:38:39,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:39,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:39,030 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [19] [2019-02-18 09:38:39,030 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:39,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:39,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:39,034 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 48 root evaluator evaluations with a maximum evaluation depth of 2. Performed 48 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:39,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:39,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:39,034 INFO 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-18 09:38:39,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:39,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:39,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:39,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:39,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:39,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:39,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:39,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:39,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:39,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:39,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,183 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,192 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,219 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:39,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:39,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:39,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:39,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:39,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:39,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:39,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:39,390 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:39,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 09:38:39,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:39,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:39,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:39,435 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-18 09:38:39,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:39,501 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-18 09:38:39,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:39,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:39,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:39,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:39,520 INFO L87 Difference]: Start difference. First operand 59 states and 238 transitions. Second operand 11 states. [2019-02-18 09:38:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:40,002 INFO L93 Difference]: Finished difference Result 95 states and 298 transitions. [2019-02-18 09:38:40,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:40,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:38:40,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:40,004 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:38:40,004 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:38:40,005 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-18 09:38:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:38:40,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-02-18 09:38:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:38:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 247 transitions. [2019-02-18 09:38:40,049 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 247 transitions. Word has length 6 [2019-02-18 09:38:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:40,049 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 247 transitions. [2019-02-18 09:38:40,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 247 transitions. [2019-02-18 09:38:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:40,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:40,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:40,050 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash 893362642, now seen corresponding path program 1 times [2019-02-18 09:38:40,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:40,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:40,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,205 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-18 09:38:40,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:40,206 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [23] [2019-02-18 09:38:40,208 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:40,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:40,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:40,211 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:40,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:40,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:40,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:40,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:40,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:40,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,405 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:40,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:40,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,513 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,541 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:40,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:40,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:40,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:40,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:40,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:40,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:40,645 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-18 09:38:40,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:40,660 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-18 09:38:40,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:40,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 09:38:40,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:40,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:40,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:40,680 INFO L87 Difference]: Start difference. First operand 61 states and 247 transitions. Second operand 9 states. [2019-02-18 09:38:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:41,610 INFO L93 Difference]: Finished difference Result 90 states and 328 transitions. [2019-02-18 09:38:41,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:41,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:38:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:41,612 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:38:41,612 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:38:41,613 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-18 09:38:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:38:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2019-02-18 09:38:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 09:38:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 308 transitions. [2019-02-18 09:38:41,653 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 308 transitions. Word has length 6 [2019-02-18 09:38:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:41,654 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 308 transitions. [2019-02-18 09:38:41,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 308 transitions. [2019-02-18 09:38:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:41,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:41,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:41,654 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash 893472132, now seen corresponding path program 1 times [2019-02-18 09:38:41,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:41,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:41,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:41,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,200 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-18 09:38:42,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,201 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:42,201 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [21] [2019-02-18 09:38:42,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:42,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:42,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:42,211 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:42,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:42,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:42,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,211 INFO 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-18 09:38:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:42,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:42,366 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-02-18 09:38:42,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:42,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:42,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:42,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:42,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-02-18 09:38:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-18 09:38:42,472 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,491 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2019-02-18 09:38:42,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:42,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:42,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,548 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:42,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-18 09:38:42,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 09:38:42,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:42,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 09:38:42,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:42,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-18 09:38:42,610 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-18 09:38:42,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:42,653 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-18 09:38:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:42,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:42,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:42,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:42,673 INFO L87 Difference]: Start difference. First operand 72 states and 308 transitions. Second operand 10 states. [2019-02-18 09:38:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:42,992 INFO L93 Difference]: Finished difference Result 122 states and 469 transitions. [2019-02-18 09:38:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:42,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 09:38:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:42,994 INFO L225 Difference]: With dead ends: 122 [2019-02-18 09:38:42,994 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 09:38:42,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 09:38:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2019-02-18 09:38:43,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:38:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 434 transitions. [2019-02-18 09:38:43,045 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 434 transitions. Word has length 6 [2019-02-18 09:38:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,046 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 434 transitions. [2019-02-18 09:38:43,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 434 transitions. [2019-02-18 09:38:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:43,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:43,047 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 897235472, now seen corresponding path program 1 times [2019-02-18 09:38:43,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:43,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:43,201 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:43,201 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [23] [2019-02-18 09:38:43,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:43,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:43,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:43,206 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:43,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:43,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:43,207 INFO 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-18 09:38:43,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:43,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:43,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:43,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:43,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:43,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:43,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:43,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:38:43,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:38:43,350 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,377 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,401 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 09:38:43,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:38:43,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:43,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:43,460 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:43,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-18 09:38:43,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:43,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:43,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 09:38:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:43,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:43,531 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-18 09:38:43,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:43,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:43,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:43,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:43,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:43,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:43,551 INFO L87 Difference]: Start difference. First operand 96 states and 434 transitions. Second operand 8 states. [2019-02-18 09:38:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:43,767 INFO L93 Difference]: Finished difference Result 113 states and 457 transitions. [2019-02-18 09:38:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:38:43,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:43,769 INFO L225 Difference]: With dead ends: 113 [2019-02-18 09:38:43,769 INFO L226 Difference]: Without dead ends: 108 [2019-02-18 09:38:43,770 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-18 09:38:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-18 09:38:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-02-18 09:38:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:38:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 438 transitions. [2019-02-18 09:38:43,830 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 438 transitions. Word has length 6 [2019-02-18 09:38:43,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:43,830 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 438 transitions. [2019-02-18 09:38:43,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 438 transitions. [2019-02-18 09:38:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:43,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:43,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:43,831 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:43,832 INFO L82 PathProgramCache]: Analyzing trace with hash 896931732, now seen corresponding path program 2 times [2019-02-18 09:38:43,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:43,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:43,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:43,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:44,148 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-02-18 09:38:44,184 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-18 09:38:44,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:44,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:44,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:44,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:44,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:44,185 INFO 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-18 09:38:44,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:44,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:44,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:44,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:44,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:44,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:44,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:44,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:44,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:44,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:44,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:44,350 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,445 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,531 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,557 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:44,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:44,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:44,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:44,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:44,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,673 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:44,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:44,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 71 [2019-02-18 09:38:44,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:44,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:44,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:44,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:44,744 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-18 09:38:44,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:44,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:38:44,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:44,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:38:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:38:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:44,763 INFO L87 Difference]: Start difference. First operand 97 states and 438 transitions. Second operand 9 states. [2019-02-18 09:38:45,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:45,106 INFO L93 Difference]: Finished difference Result 137 states and 550 transitions. [2019-02-18 09:38:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:45,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 09:38:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:45,109 INFO L225 Difference]: With dead ends: 137 [2019-02-18 09:38:45,109 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 09:38:45,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 09:38:45,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-18 09:38:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:38:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 421 transitions. [2019-02-18 09:38:45,160 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 421 transitions. Word has length 6 [2019-02-18 09:38:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:45,160 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 421 transitions. [2019-02-18 09:38:45,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:38:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 421 transitions. [2019-02-18 09:38:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:45,161 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:45,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:45,161 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 900929556, now seen corresponding path program 1 times [2019-02-18 09:38:45,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,201 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-18 09:38:45,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:45,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:45,202 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [20], [22], [23] [2019-02-18 09:38:45,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:45,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:45,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:45,206 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:45,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:45,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:45,207 INFO 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-18 09:38:45,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:45,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:45,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 09:38:45,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-18 09:38:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-18 09:38:45,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:45,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:45,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:38:45,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:38:45,365 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,401 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,407 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:45,428 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:30, output treesize:33 [2019-02-18 09:38:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:45,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 09:38:45,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:45,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:38:45,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:45,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:45,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-18 09:38:45,574 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-18 09:38:45,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:45,592 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-18 09:38:45,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:45,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:38:45,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:45,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:45,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:45,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:45,613 INFO L87 Difference]: Start difference. First operand 93 states and 421 transitions. Second operand 8 states. [2019-02-18 09:38:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:45,818 INFO L93 Difference]: Finished difference Result 110 states and 439 transitions. [2019-02-18 09:38:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:38:45,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 09:38:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:45,820 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:38:45,821 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:38:45,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:38:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:38:45,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2019-02-18 09:38:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 09:38:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 406 transitions. [2019-02-18 09:38:45,870 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 406 transitions. Word has length 6 [2019-02-18 09:38:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:45,870 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 406 transitions. [2019-02-18 09:38:45,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 406 transitions. [2019-02-18 09:38:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:45,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:45,871 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 09:38:45,872 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:45,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash 900915912, now seen corresponding path program 2 times [2019-02-18 09:38:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:45,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:46,011 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-18 09:38:46,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:46,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:46,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:46,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:46,012 INFO 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-18 09:38:46,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:46,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:46,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:46,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:46,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:46,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:46,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:46,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:46,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:46,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:46,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:46,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:46,181 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,199 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,218 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:46,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:46,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:46,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:46,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:46,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,330 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:46,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 09:38:46,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:46,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:46,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:46,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:46,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:46,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:46,428 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-18 09:38:46,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:46,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:46,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 09:38:46,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:46,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:46,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:46,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:38:46,487 INFO L87 Difference]: Start difference. First operand 90 states and 406 transitions. Second operand 11 states. [2019-02-18 09:38:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:46,939 INFO L93 Difference]: Finished difference Result 124 states and 476 transitions. [2019-02-18 09:38:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:46,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-18 09:38:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:46,940 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:38:46,940 INFO L226 Difference]: Without dead ends: 116 [2019-02-18 09:38:46,940 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-18 09:38:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-18 09:38:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2019-02-18 09:38:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:38:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 435 transitions. [2019-02-18 09:38:46,995 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 435 transitions. Word has length 6 [2019-02-18 09:38:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:46,995 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 435 transitions. [2019-02-18 09:38:46,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 435 transitions. [2019-02-18 09:38:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:46,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:46,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:46,996 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 900919446, now seen corresponding path program 1 times [2019-02-18 09:38:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:46,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:46,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,157 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-18 09:38:47,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:47,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:38:47,158 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [19] [2019-02-18 09:38:47,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:47,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:47,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:47,161 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 50 root evaluator evaluations with a maximum evaluation depth of 2. Performed 50 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:38:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:47,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:47,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:47,161 INFO 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-18 09:38:47,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:47,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:47,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:47,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:47,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:47,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:47,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:47,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,254 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:47,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:47,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:47,365 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,383 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,402 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:47,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:47,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:47,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 09:38:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,521 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:47,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 09:38:47,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:47,587 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:47,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 09:38:47,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:47,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 09:38:47,632 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-18 09:38:47,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:47,676 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-18 09:38:47,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:47,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:47,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:47,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:47,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:47,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:47,695 INFO L87 Difference]: Start difference. First operand 97 states and 435 transitions. Second operand 12 states. [2019-02-18 09:38:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:48,211 INFO L93 Difference]: Finished difference Result 137 states and 564 transitions. [2019-02-18 09:38:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:48,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:48,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:48,213 INFO L225 Difference]: With dead ends: 137 [2019-02-18 09:38:48,213 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 09:38:48,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:48,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 09:38:48,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2019-02-18 09:38:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:38:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 465 transitions. [2019-02-18 09:38:48,284 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 465 transitions. Word has length 6 [2019-02-18 09:38:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:48,284 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 465 transitions. [2019-02-18 09:38:48,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 465 transitions. [2019-02-18 09:38:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:48,285 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:48,285 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:48,285 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:48,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:48,286 INFO L82 PathProgramCache]: Analyzing trace with hash 900627426, now seen corresponding path program 2 times [2019-02-18 09:38:48,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:48,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:48,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:48,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:48,504 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-02-18 09:38:48,562 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-18 09:38:48,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:48,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:48,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:48,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:48,563 INFO 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-18 09:38:48,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:48,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:48,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:48,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:48,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:48,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:48,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:48,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:48,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:48,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,633 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:48,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:48,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:48,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,775 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,802 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:48,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:48,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:48,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,879 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:48,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:38:48,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:48,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:48,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:48,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:48,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-18 09:38:48,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,996 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:48,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:48,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:38:48,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:49,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:49,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 09:38:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:49,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:49,096 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-18 09:38:49,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:49,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:49,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:49,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:49,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:49,116 INFO L87 Difference]: Start difference. First operand 103 states and 465 transitions. Second operand 12 states. [2019-02-18 09:38:49,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:49,744 INFO L93 Difference]: Finished difference Result 172 states and 721 transitions. [2019-02-18 09:38:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:49,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:49,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:49,747 INFO L225 Difference]: With dead ends: 172 [2019-02-18 09:38:49,747 INFO L226 Difference]: Without dead ends: 167 [2019-02-18 09:38:49,748 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-18 09:38:49,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-18 09:38:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 116. [2019-02-18 09:38:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-18 09:38:49,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 529 transitions. [2019-02-18 09:38:49,834 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 529 transitions. Word has length 6 [2019-02-18 09:38:49,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:49,834 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 529 transitions. [2019-02-18 09:38:49,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 529 transitions. [2019-02-18 09:38:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:38:49,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:49,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:38:49,836 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:49,836 INFO L82 PathProgramCache]: Analyzing trace with hash 900621846, now seen corresponding path program 3 times [2019-02-18 09:38:49,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:49,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:49,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:50,189 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-02-18 09:38:50,250 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-18 09:38:50,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:50,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:50,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:50,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:50,251 INFO 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-18 09:38:50,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:50,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:50,267 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:50,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:50,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:50,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:50,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:50,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:50,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:50,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:50,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:50,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:50,417 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,468 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:50,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:50,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:50,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,558 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:50,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:38:50,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:50,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 09:38:50,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2019-02-18 09:38:50,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:50,657 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:50,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-18 09:38:50,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:50,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:50,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:31 [2019-02-18 09:38:50,699 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-18 09:38:50,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:50,750 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-18 09:38:50,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:50,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:38:50,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:50,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:50,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:50,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:38:50,768 INFO L87 Difference]: Start difference. First operand 116 states and 529 transitions. Second operand 12 states. [2019-02-18 09:38:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:51,227 INFO L93 Difference]: Finished difference Result 140 states and 566 transitions. [2019-02-18 09:38:51,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:51,227 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-18 09:38:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:51,229 INFO L225 Difference]: With dead ends: 140 [2019-02-18 09:38:51,229 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:38:51,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:38:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:38:51,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 46. [2019-02-18 09:38:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:38:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 176 transitions. [2019-02-18 09:38:51,272 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 176 transitions. Word has length 6 [2019-02-18 09:38:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:51,272 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 176 transitions. [2019-02-18 09:38:51,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 176 transitions. [2019-02-18 09:38:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:51,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:51,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:51,273 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:51,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2088231584, now seen corresponding path program 1 times [2019-02-18 09:38:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:51,447 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-18 09:38:51,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:51,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:51,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:51,448 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [20], [22], [23] [2019-02-18 09:38:51,449 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:51,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:51,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:51,451 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:51,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:51,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:51,452 INFO 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-18 09:38:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:51,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:51,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:51,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:51,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:51,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:51,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:51,618 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,627 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,635 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,653 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:51,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:51,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:51,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:51,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,773 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:51,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:51,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:38:51,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:51,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:51,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 09:38:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:51,850 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-18 09:38:51,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:51,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:51,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:51,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:51,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:51,869 INFO L87 Difference]: Start difference. First operand 46 states and 176 transitions. Second operand 10 states. [2019-02-18 09:38:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:52,421 INFO L93 Difference]: Finished difference Result 77 states and 262 transitions. [2019-02-18 09:38:52,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:52,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:52,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:52,422 INFO L225 Difference]: With dead ends: 77 [2019-02-18 09:38:52,422 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 09:38:52,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:38:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 09:38:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2019-02-18 09:38:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:38:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 213 transitions. [2019-02-18 09:38:52,479 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 213 transitions. Word has length 7 [2019-02-18 09:38:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:52,479 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 213 transitions. [2019-02-18 09:38:52,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 213 transitions. [2019-02-18 09:38:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:52,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:52,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:52,480 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:52,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2088122094, now seen corresponding path program 1 times [2019-02-18 09:38:52,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:38:52,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:52,571 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [21] [2019-02-18 09:38:52,572 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,575 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:38:52,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:52,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:52,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:52,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:52,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:52,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:52,619 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,645 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:52,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:52,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:52,732 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,751 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,768 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:52,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:52,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:52,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:52,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:38:52,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:52,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:52,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,885 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:52,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:38:52,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:52,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:38:52,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,934 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:52,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:38:52,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:52,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:52,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 09:38:52,979 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-18 09:38:52,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:53,020 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-18 09:38:53,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:38:53,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:53,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:38:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:38:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:53,040 INFO L87 Difference]: Start difference. First operand 54 states and 213 transitions. Second operand 12 states. [2019-02-18 09:38:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:53,558 INFO L93 Difference]: Finished difference Result 86 states and 270 transitions. [2019-02-18 09:38:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:53,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 09:38:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:53,560 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:38:53,560 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:38:53,561 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-18 09:38:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:38:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2019-02-18 09:38:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:38:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 208 transitions. [2019-02-18 09:38:53,642 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 208 transitions. Word has length 7 [2019-02-18 09:38:53,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:53,642 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 208 transitions. [2019-02-18 09:38:53,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:38:53,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 208 transitions. [2019-02-18 09:38:53,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:53,642 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:53,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:53,643 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:53,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2084237604, now seen corresponding path program 1 times [2019-02-18 09:38:53,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:53,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:53,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:53,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:53,846 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-18 09:38:53,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:53,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:53,847 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:53,847 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [20], [22], [24], [25] [2019-02-18 09:38:53,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:53,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:53,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:53,850 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:53,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:53,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:53,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:53,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:53,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:53,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:53,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-18 09:38:53,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:53,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:38:53,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-02-18 09:38:53,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:53,908 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:15, output treesize:21 [2019-02-18 09:38:53,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 09:38:53,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:38:53,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 09:38:53,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2019-02-18 09:38:53,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-18 09:38:53,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,977 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:53,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-02-18 09:38:53,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:38:53,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2019-02-18 09:38:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:54,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:54,018 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-18 09:38:54,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:38:54,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 9 [2019-02-18 09:38:54,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:54,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:38:54,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:38:54,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:54,038 INFO L87 Difference]: Start difference. First operand 53 states and 208 transitions. Second operand 5 states. [2019-02-18 09:38:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:54,260 INFO L93 Difference]: Finished difference Result 115 states and 427 transitions. [2019-02-18 09:38:54,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:38:54,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-18 09:38:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:54,262 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:38:54,262 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:38:54,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:38:54,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:38:54,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2019-02-18 09:38:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:38:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 343 transitions. [2019-02-18 09:38:54,371 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 343 transitions. Word has length 7 [2019-02-18 09:38:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:54,371 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 343 transitions. [2019-02-18 09:38:54,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:38:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 343 transitions. [2019-02-18 09:38:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:54,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:54,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:54,372 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:54,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2084662494, now seen corresponding path program 2 times [2019-02-18 09:38:54,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:54,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:54,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:54,730 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2019-02-18 09:38:54,769 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-18 09:38:54,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:54,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:54,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:54,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:54,770 INFO 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-18 09:38:54,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:54,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:54,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:54,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:54,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:54,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:54,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:54,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:54,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,841 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:54,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:54,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:54,926 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,962 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:54,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:38:54,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:55,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,034 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 09:38:55,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:55,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-18 09:38:55,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 09:38:55,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:55,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:55,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:55,132 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:55,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 09:38:55,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:55,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:55,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 09:38:55,181 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-18 09:38:55,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:55,228 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-18 09:38:55,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 09:38:55,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:55,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:38:55,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:38:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:55,247 INFO L87 Difference]: Start difference. First operand 84 states and 343 transitions. Second operand 11 states. [2019-02-18 09:38:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:55,881 INFO L93 Difference]: Finished difference Result 104 states and 372 transitions. [2019-02-18 09:38:55,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:38:55,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:38:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:55,883 INFO L225 Difference]: With dead ends: 104 [2019-02-18 09:38:55,883 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:38:55,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:38:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:38:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 47. [2019-02-18 09:38:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:38:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 177 transitions. [2019-02-18 09:38:55,957 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 177 transitions. Word has length 7 [2019-02-18 09:38:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:55,957 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 177 transitions. [2019-02-18 09:38:55,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:38:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 177 transitions. [2019-02-18 09:38:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:55,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:55,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:55,958 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:55,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2080843416, now seen corresponding path program 1 times [2019-02-18 09:38:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:55,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:55,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:55,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:56,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:56,019 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:56,020 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [16], [20], [22], [23] [2019-02-18 09:38:56,021 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:56,021 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:56,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:56,024 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:56,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:56,025 INFO 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-18 09:38:56,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:56,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:56,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:56,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:38:56,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:38:56,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,105 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:56,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:56,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:56,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,189 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,204 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 09:38:56,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 09:38:56,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:38:56,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:38:56,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 09:38:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,296 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:56,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-18 09:38:56,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:56,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:56,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2019-02-18 09:38:56,325 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-18 09:38:56,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:56,360 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-18 09:38:56,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:56,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:38:56,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:56,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:56,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:38:56,379 INFO L87 Difference]: Start difference. First operand 47 states and 177 transitions. Second operand 10 states. [2019-02-18 09:38:56,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:56,763 INFO L93 Difference]: Finished difference Result 68 states and 235 transitions. [2019-02-18 09:38:56,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:56,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:56,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:56,764 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:38:56,764 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:38:56,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:38:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:38:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-02-18 09:38:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:38:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 190 transitions. [2019-02-18 09:38:56,856 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 190 transitions. Word has length 7 [2019-02-18 09:38:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:56,857 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 190 transitions. [2019-02-18 09:38:56,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 190 transitions. [2019-02-18 09:38:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:56,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:56,857 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 09:38:56,857 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1920744098, now seen corresponding path program 1 times [2019-02-18 09:38:56,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:56,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:56,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:56,904 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-18 09:38:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:38:56,904 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:56,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:38:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:38:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:56,905 INFO L87 Difference]: Start difference. First operand 50 states and 190 transitions. Second operand 4 states. [2019-02-18 09:38:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:57,021 INFO L93 Difference]: Finished difference Result 54 states and 193 transitions. [2019-02-18 09:38:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:57,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-18 09:38:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:57,022 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:38:57,023 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:38:57,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:38:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:38:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-18 09:38:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:38:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 189 transitions. [2019-02-18 09:38:57,125 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 189 transitions. Word has length 7 [2019-02-18 09:38:57,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:57,125 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 189 transitions. [2019-02-18 09:38:57,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:38:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 189 transitions. [2019-02-18 09:38:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:57,126 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:57,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:57,126 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1928011116, now seen corresponding path program 1 times [2019-02-18 09:38:57,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:57,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:57,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:57,276 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-18 09:38:57,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:57,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:57,277 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [23] [2019-02-18 09:38:57,279 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:57,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:57,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:57,282 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:38:57,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:57,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:57,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:57,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:38:57,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:57,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:57,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:57,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:57,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:57,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:57,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:57,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:57,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:57,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:57,478 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,742 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,948 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:57,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:57,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:57,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:57,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:58,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,026 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:38:58,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 09:38:58,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 09:38:58,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:58,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-18 09:38:58,128 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-18 09:38:58,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:58,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:58,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:38:58,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:58,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:38:58,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:38:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:38:58,172 INFO L87 Difference]: Start difference. First operand 50 states and 189 transitions. Second operand 10 states. [2019-02-18 09:38:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:58,583 INFO L93 Difference]: Finished difference Result 78 states and 242 transitions. [2019-02-18 09:38:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:38:58,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:38:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:58,584 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:38:58,585 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:38:58,585 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-18 09:38:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:38:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 51. [2019-02-18 09:38:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:38:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 193 transitions. [2019-02-18 09:38:58,691 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 193 transitions. Word has length 7 [2019-02-18 09:38:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:58,691 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 193 transitions. [2019-02-18 09:38:58,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:38:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 193 transitions. [2019-02-18 09:38:58,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:58,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:58,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:58,692 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:58,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2035260702, now seen corresponding path program 1 times [2019-02-18 09:38:58,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:58,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:58,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,794 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-18 09:38:58,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:58,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:38:58,795 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [22], [24], [25] [2019-02-18 09:38:58,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:58,797 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:58,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:58,799 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:38:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:58,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:58,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:58,799 INFO 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-18 09:38:58,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:58,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:58,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:38:58,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:38:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:58,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:38:58,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:58,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:38:58,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:38:58,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:38:58,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,956 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,964 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:58,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:58,989 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:38:59,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:38:59,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:38:59,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 09:38:59,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:59,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 09:38:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:59,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:59,114 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-18 09:38:59,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:59,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 09:38:59,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:59,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:38:59,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:38:59,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:38:59,133 INFO L87 Difference]: Start difference. First operand 51 states and 193 transitions. Second operand 8 states. [2019-02-18 09:38:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:59,618 INFO L93 Difference]: Finished difference Result 64 states and 222 transitions. [2019-02-18 09:38:59,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:38:59,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 09:38:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:59,619 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:38:59,619 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:38:59,620 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-18 09:38:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:38:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2019-02-18 09:38:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:38:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 187 transitions. [2019-02-18 09:38:59,729 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 187 transitions. Word has length 7 [2019-02-18 09:38:59,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:59,730 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 187 transitions. [2019-02-18 09:38:59,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:38:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 187 transitions. [2019-02-18 09:38:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:38:59,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:59,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:38:59,730 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2042527720, now seen corresponding path program 2 times [2019-02-18 09:38:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:59,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:59,805 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-18 09:38:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:59,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:59,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:59,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:59,806 INFO 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-18 09:38:59,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:59,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:59,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:38:59,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:59,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:59,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:38:59,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:38:59,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:59,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:38:59,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:38:59,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:38:59,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:38:59,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:38:59,964 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,978 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,986 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:59,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,010 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:41, output treesize:41 [2019-02-18 09:39:00,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:39:00,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 09:39:00,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 09:39:00,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 09:39:00,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,115 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:00,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 55 [2019-02-18 09:39:00,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:00,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-18 09:39:00,146 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-18 09:39:00,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:00,185 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-18 09:39:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:39:00,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:00,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:00,207 INFO L87 Difference]: Start difference. First operand 50 states and 187 transitions. Second operand 10 states. [2019-02-18 09:39:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:00,646 INFO L93 Difference]: Finished difference Result 76 states and 253 transitions. [2019-02-18 09:39:00,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:39:00,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:39:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:00,647 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:39:00,648 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:39:00,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:00,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:39:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2019-02-18 09:39:00,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:39:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 191 transitions. [2019-02-18 09:39:00,775 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 191 transitions. Word has length 7 [2019-02-18 09:39:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:00,775 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 191 transitions. [2019-02-18 09:39:00,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 191 transitions. [2019-02-18 09:39:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:39:00,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:00,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:00,776 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:00,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2141495906, now seen corresponding path program 1 times [2019-02-18 09:39:00,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:00,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:00,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,892 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-18 09:39:00,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:00,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 09:39:00,893 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [22], [24], [25] [2019-02-18 09:39:00,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:00,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:00,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:00,897 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:00,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:00,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:00,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:00,898 INFO 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-18 09:39:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:00,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:00,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:00,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 09:39:00,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-18 09:39:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:00,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-18 09:39:00,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:00,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:39:00,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:39:00,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:39:00,985 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:00,996 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:01,026 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-18 09:39:01,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:39:01,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:01,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:01,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-18 09:39:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,120 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:01,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:01,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:01,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-18 09:39:01,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:01,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:01,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-18 09:39:01,202 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-18 09:39:01,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:01,219 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-18 09:39:01,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:01,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-18 09:39:01,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:01,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:39:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:39:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:39:01,239 INFO L87 Difference]: Start difference. First operand 51 states and 191 transitions. Second operand 10 states. [2019-02-18 09:39:01,793 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2019-02-18 09:39:02,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:02,380 INFO L93 Difference]: Finished difference Result 90 states and 306 transitions. [2019-02-18 09:39:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:02,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 09:39:02,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:02,382 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:39:02,382 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:39:02,382 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-18 09:39:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:39:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2019-02-18 09:39:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:39:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 241 transitions. [2019-02-18 09:39:02,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 241 transitions. Word has length 7 [2019-02-18 09:39:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:02,613 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 241 transitions. [2019-02-18 09:39:02,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:39:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 241 transitions. [2019-02-18 09:39:02,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:39:02,613 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:02,613 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:02,614 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash -314363692, now seen corresponding path program 1 times [2019-02-18 09:39:02,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:02,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:02,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:02,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:02,772 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-18 09:39:02,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:02,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:02,772 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:39:02,772 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [20], [22], [24], [25] [2019-02-18 09:39:02,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:02,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:02,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:02,776 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:02,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:02,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:02,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:02,776 INFO 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-18 09:39:02,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:02,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:02,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:02,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:02,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:39:02,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:39:02,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:39:02,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:02,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:02,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:02,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:02,947 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,955 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:02,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:02,984 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:49, output treesize:45 [2019-02-18 09:39:03,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:03,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:03,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:03,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:03,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:03,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:03,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:03,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 09:39:03,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:03,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:03,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:03,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:03,181 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-18 09:39:03,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:03,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 09:39:03,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:03,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:39:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:39:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:39:03,202 INFO L87 Difference]: Start difference. First operand 63 states and 241 transitions. Second operand 11 states. [2019-02-18 09:39:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:03,875 INFO L93 Difference]: Finished difference Result 118 states and 409 transitions. [2019-02-18 09:39:03,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:39:03,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 09:39:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:03,876 INFO L225 Difference]: With dead ends: 118 [2019-02-18 09:39:03,877 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:39:03,877 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-18 09:39:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:39:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 62. [2019-02-18 09:39:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 09:39:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 229 transitions. [2019-02-18 09:39:04,093 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 229 transitions. Word has length 8 [2019-02-18 09:39:04,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:04,094 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 229 transitions. [2019-02-18 09:39:04,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:39:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 229 transitions. [2019-02-18 09:39:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:39:04,094 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:04,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:04,094 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:04,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash -307275420, now seen corresponding path program 1 times [2019-02-18 09:39:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:04,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:04,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,209 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-18 09:39:04,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:04,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:39:04,209 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [16], [20], [22], [23] [2019-02-18 09:39:04,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:04,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:04,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:04,213 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 09:39:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:04,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:04,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:04,214 INFO 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-18 09:39:04,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:04,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:04,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:04,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:04,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:39:04,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:39:04,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:39:04,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:04,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:04,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:04,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,403 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,430 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:39:04,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:04,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:04,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:04,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:04,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,726 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:04,726 INFO L303 Elim1Store]: Index analysis took 171 ms [2019-02-18 09:39:04,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:04,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,777 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:04,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:39:04,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:04,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:04,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2019-02-18 09:39:04,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-18 09:39:04,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:04,863 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-18 09:39:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 09:39:04,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:04,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:39:04,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:39:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:04,883 INFO L87 Difference]: Start difference. First operand 62 states and 229 transitions. Second operand 13 states. [2019-02-18 09:39:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:05,722 INFO L93 Difference]: Finished difference Result 124 states and 443 transitions. [2019-02-18 09:39:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:39:05,722 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 09:39:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:05,723 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:39:05,724 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:39:05,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:39:05,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:39:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 73. [2019-02-18 09:39:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:39:06,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 277 transitions. [2019-02-18 09:39:06,015 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 277 transitions. Word has length 8 [2019-02-18 09:39:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:06,016 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 277 transitions. [2019-02-18 09:39:06,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:39:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 277 transitions. [2019-02-18 09:39:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:39:06,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:06,016 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:06,017 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -592077742, now seen corresponding path program 1 times [2019-02-18 09:39:06,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:06,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:06,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:06,113 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-18 09:39:06,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:06,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:06,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:39:06,114 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [22], [24], [25] [2019-02-18 09:39:06,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:06,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:06,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:06,118 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 52 root evaluator evaluations with a maximum evaluation depth of 2. Performed 52 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:39:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:06,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:06,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:06,118 INFO 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-18 09:39:06,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:06,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:06,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:06,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:06,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:06,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:39:06,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 09:39:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 33 [2019-02-18 09:39:06,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2019-02-18 09:39:06,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2019-02-18 09:39:06,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2019-02-18 09:39:06,215 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:06,240 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:30, output treesize:33 [2019-02-18 09:39:06,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 09:39:06,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:06,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 09:39:06,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-18 09:39:06,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:06,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-18 09:39:06,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:06,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:32 [2019-02-18 09:39:06,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 09:39:06,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:06,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-18 09:39:06,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:06,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:06,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:28 [2019-02-18 09:39:06,478 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-18 09:39:06,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:06,512 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-18 09:39:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:06,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 09:39:06,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:06,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:39:06,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:39:06,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:39:06,531 INFO L87 Difference]: Start difference. First operand 73 states and 277 transitions. Second operand 9 states. [2019-02-18 09:39:06,798 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2019-02-18 09:39:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:07,271 INFO L93 Difference]: Finished difference Result 87 states and 314 transitions. [2019-02-18 09:39:07,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:39:07,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 09:39:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:07,273 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:39:07,273 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:39:07,273 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-18 09:39:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:39:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-02-18 09:39:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:39:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 297 transitions. [2019-02-18 09:39:07,608 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 297 transitions. Word has length 8 [2019-02-18 09:39:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:07,608 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 297 transitions. [2019-02-18 09:39:07,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:39:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 297 transitions. [2019-02-18 09:39:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:39:07,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:07,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:07,609 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:07,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:07,610 INFO L82 PathProgramCache]: Analyzing trace with hash -477682288, now seen corresponding path program 2 times [2019-02-18 09:39:07,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:07,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:07,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:07,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:07,748 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 09:39:07,831 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-18 09:39:07,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:07,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:07,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:07,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:07,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:39:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:39:07,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:39:07,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:39:07,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:07,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:07,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:07,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-02-18 09:39:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 30 [2019-02-18 09:39:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 41 [2019-02-18 09:39:07,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 09:39:07,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 09:39:07,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:07,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 09:39:07,957 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,966 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,975 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:07,992 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:41, output treesize:41 [2019-02-18 09:39:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:08,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:39:08,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:08,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:58 [2019-02-18 09:39:08,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 09:39:08,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,244 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2019-02-18 09:39:08,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:08,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:54 [2019-02-18 09:39:08,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,328 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-02-18 09:39:08,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-02-18 09:39:08,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:08,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:48 [2019-02-18 09:39:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-18 09:39:08,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:08,482 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:08,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-18 09:39:08,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:08,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 09:39:08,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:68, output treesize:48 [2019-02-18 09:39:08,547 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-18 09:39:08,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:08,593 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-18 09:39:08,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:08,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 09:39:08,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:08,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:39:08,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:39:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:39:08,614 INFO L87 Difference]: Start difference. First operand 78 states and 297 transitions. Second operand 13 states. [2019-02-18 09:39:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:09,901 INFO L93 Difference]: Finished difference Result 186 states and 694 transitions. [2019-02-18 09:39:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:39:09,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-02-18 09:39:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:09,905 INFO L225 Difference]: With dead ends: 186 [2019-02-18 09:39:09,906 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 09:39:09,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:39:09,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 09:39:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2019-02-18 09:39:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:39:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 371 transitions. [2019-02-18 09:39:10,340 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 371 transitions. Word has length 8 [2019-02-18 09:39:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 371 transitions. [2019-02-18 09:39:10,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:39:10,340 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 371 transitions. [2019-02-18 09:39:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:39:10,341 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:10,341 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:10,341 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,341 INFO L82 PathProgramCache]: Analyzing trace with hash -931909288, now seen corresponding path program 1 times [2019-02-18 09:39:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:39:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:10,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:10,683 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 12 [2019-02-18 09:39:10,796 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-18 09:39:10,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:10,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:39:10,797 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [16], [20], [22], [24], [25] [2019-02-18 09:39:10,801 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:10,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:10,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:10,803 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:39:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:10,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:10,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:10,804 INFO 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-18 09:39:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:10,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:10,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:10,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:10,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:10,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:10,896 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:10,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:39:10,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:39:10,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:39:10,942 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,957 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,964 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:10,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:10,991 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-02-18 09:39:11,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:39:11,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:11,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:11,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 09:39:11,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,104 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:11,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:11,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:11,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:11,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 89 [2019-02-18 09:39:11,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:11,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:11,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 09:39:11,210 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-18 09:39:11,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:11,254 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-18 09:39:11,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:11,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:39:11,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:11,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:39:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:39:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:39:11,273 INFO L87 Difference]: Start difference. First operand 95 states and 371 transitions. Second operand 12 states. [2019-02-18 09:39:12,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:12,048 INFO L93 Difference]: Finished difference Result 110 states and 418 transitions. [2019-02-18 09:39:12,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:12,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 09:39:12,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:12,053 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:39:12,053 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 09:39:12,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:39:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 09:39:12,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 26. [2019-02-18 09:39:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:39:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 09:39:12,170 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 9 [2019-02-18 09:39:12,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:12,171 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 09:39:12,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:39:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 09:39:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:39:12,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:12,171 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:39:12,171 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:12,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash -898856470, now seen corresponding path program 3 times [2019-02-18 09:39:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:12,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:12,289 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-18 09:39:12,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:12,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:39:12,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:39:12,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:12,291 INFO 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-18 09:39:12,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:39:12,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:39:12,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:39:12,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:39:12,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:12,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 09:39:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 09:39:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 09:39:12,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-02-18 09:39:12,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-02-18 09:39:12,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-02-18 09:39:12,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-02-18 09:39:12,430 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,503 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2019-02-18 09:39:12,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 09:39:12,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 09:39:12,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:39:12,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2019-02-18 09:39:12,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,709 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:12,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 09:39:12,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:27 [2019-02-18 09:39:12,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,794 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:39:12,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 09:39:12,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:29 [2019-02-18 09:39:12,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:12,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 59 [2019-02-18 09:39:12,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:12,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:12,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2019-02-18 09:39:12,910 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-18 09:39:12,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:12,985 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-18 09:39:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 09:39:13,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:13,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:39:13,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:39:13,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:39:13,005 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 13 states. [2019-02-18 09:39:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:13,486 INFO L93 Difference]: Finished difference Result 32 states and 109 transitions. [2019-02-18 09:39:13,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:39:13,486 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:39:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:13,487 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:39:13,487 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 09:39:13,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:39:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 09:39:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 09:39:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 09:39:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 09:39:13,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2019-02-18 09:39:13,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:13,489 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 09:39:13,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:39:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 09:39:13,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 09:39:13,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 09:39:13,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:13,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:13,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:14,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:15,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:15,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:15,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:15,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:18,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:18,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:19,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:19,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 09:39:24,996 WARN L181 SmtUtils]: Spent 11.50 s on a formula simplification. DAG size of input: 1487 DAG size of output: 1019 [2019-02-18 09:39:38,741 WARN L181 SmtUtils]: Spent 13.73 s on a formula simplification. DAG size of input: 964 DAG size of output: 85 [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 41) no Hoare annotation was computed. [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 39) no Hoare annotation was computed. [2019-02-18 09:39:38,745 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 27 37) the Hoare annotation is: (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p4))) (let ((.cse20 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse15 (- 1))))) (let ((.cse19 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse17 (select |#memory_int| ULTIMATE.start_main_p3)) (.cse7 (select .cse20 ULTIMATE.start_main_p1))) (let ((.cse16 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse0 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (.cse11 (<= 1 .cse7)) (.cse14 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (.cse22 (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse17 1))) (.cse21 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse19 1)))) (let ((.cse4 (<= (+ (select .cse21 ULTIMATE.start_main_p4) 1) 0)) (.cse8 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse5 (<= .cse15 0)) (.cse18 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4))) (.cse3 (= 0 (select .cse22 ULTIMATE.start_main_p2))) (.cse12 (= 0 (select .cse20 ULTIMATE.start_main_p2))) (.cse9 (and .cse0 .cse11 .cse14)) (.cse1 (= 0 (select .cse22 ULTIMATE.start_main_p1))) (.cse2 (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse16 (- 1)))) (.cse6 (<= (+ (select .cse21 ULTIMATE.start_main_p2) 1) 0)) (.cse13 (select .cse20 ULTIMATE.start_main_p3))) (or (and (and .cse0 .cse1 (= 0 (select .cse2 ULTIMATE.start_main_p3)) .cse3) .cse4) (let ((.cse10 (= 0 .cse13))) (or (and .cse5 (and (or (and .cse6 (= 0 .cse7) .cse8) (and .cse6 .cse9)) .cse10)) (and (and .cse10 .cse11 .cse12 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) .cse4))) (and .cse14 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse15 0) (<= .cse16 0) (= .cse17 0) .cse8 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) .cse18 (<= 0 .cse19)) (and .cse5 (and (or (and .cse14 .cse0 .cse1 .cse18 .cse3) (or (and .cse12 .cse9) (and .cse6 (and .cse1 .cse14)) (and (<= 1 (select .cse2 ULTIMATE.start_main_p1)) .cse6))) (<= 1 .cse13))))))))) [2019-02-18 09:39:38,745 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 40) no Hoare annotation was computed. [2019-02-18 09:39:38,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-18 09:39:38,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2019-02-18 09:39:38,746 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 44) no Hoare annotation was computed. [2019-02-18 09:39:38,746 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-02-18 09:39:38,764 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 09:39:38 BoogieIcfgContainer [2019-02-18 09:39:38,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-18 09:39:38,765 INFO L168 Benchmark]: Toolchain (without parser) took 91012.34 ms. Allocated memory was 141.0 MB in the beginning and 963.6 MB in the end (delta: 822.6 MB). Free memory was 106.2 MB in the beginning and 375.7 MB in the end (delta: -269.5 MB). Peak memory consumption was 756.0 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:38,766 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 141.0 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:39:38,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.46 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 103.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:38,766 INFO L168 Benchmark]: Boogie Preprocessor took 28.39 ms. Allocated memory is still 141.0 MB. Free memory was 103.7 MB in the beginning and 102.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:38,767 INFO L168 Benchmark]: RCFGBuilder took 311.22 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 92.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:38,767 INFO L168 Benchmark]: TraceAbstraction took 90609.02 ms. Allocated memory was 141.0 MB in the beginning and 963.6 MB in the end (delta: 822.6 MB). Free memory was 92.0 MB in the beginning and 375.7 MB in the end (delta: -283.6 MB). Peak memory consumption was 741.8 MB. Max. memory is 7.1 GB. [2019-02-18 09:39:38,769 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.13 ms. Allocated memory is still 141.0 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.46 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 103.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 28.39 ms. Allocated memory is still 141.0 MB. Free memory was 103.7 MB in the beginning and 102.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 311.22 ms. Allocated memory is still 141.0 MB. Free memory was 102.5 MB in the beginning and 92.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90609.02 ms. Allocated memory was 141.0 MB in the beginning and 963.6 MB in the end (delta: 822.6 MB). Free memory was 92.0 MB in the beginning and 375.7 MB in the end (delta: -283.6 MB). Peak memory consumption was 741.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: 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: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - 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[p2 := #memory_int[p2] + -1][p3]) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) || (#memory_int[p4] <= 0 && (((#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4))) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3]) || ((((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)) || (((((((((!(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])) || (#memory_int[p4] <= 0 && (((((!(p1 == p4) && !(p1 == p2)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1]) && !(p2 == p4)) && 0 == #memory_int[p3 := #memory_int[p3] + 1][p2]) || ((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && (!(p1 == p2) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p4)) || (#memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0 && 0 == #memory_int[p3 := #memory_int[p3] + 1][p1] && !(p1 == p4))) || (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]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 4 error locations. SAFE Result, 90.5s OverallTime, 55 OverallIterations, 3 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 25.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 198 SDtfs, 956 SDslu, 1 SDs, 0 SdLazy, 9084 SolverSat, 820 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 838 GetRequests, 140 SyntacticMatches, 32 SemanticMatches, 666 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 19.0s 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, 0.3s AbstIntTime, 36 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 55 MinimizatonAttempts, 1314 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 46 NumberOfFragments, 397 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4094942593 FormulaSimplificationTreeSizeReduction, 11.5s HoareSimplificationTime, 1 FomulaSimplificationsInter, 37002537 FormulaSimplificationTreeSizeReductionInter, 13.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 34.1s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 748 ConstructedInterpolants, 222 QuantifiedInterpolants, 91495 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...