java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:22:54,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:22:54,705 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:22:54,722 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:22:54,722 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:22:54,724 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:22:54,725 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:22:54,727 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:22:54,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:22:54,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:22:54,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:22:54,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:22:54,732 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:22:54,733 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:22:54,734 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:22:54,735 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:22:54,735 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:22:54,737 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:22:54,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:22:54,741 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:22:54,742 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:22:54,743 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:22:54,745 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:22:54,745 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:22:54,746 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:22:54,746 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:22:54,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:22:54,748 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:22:54,749 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:22:54,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:22:54,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:22:54,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:22:54,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:22:54,756 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:22:54,757 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:22:54,758 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:22:54,758 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:22:54,784 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:22:54,784 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:22:54,785 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:22:54,785 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:22:54,785 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:22:54,786 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:22:54,786 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:22:54,786 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:22:54,786 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:22:54,786 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:22:54,787 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:22:54,787 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:22:54,787 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:22:54,787 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:22:54,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:22:54,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:22:54,788 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:22:54,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:22:54,789 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:22:54,789 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:22:54,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:22:54,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:22:54,789 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:22:54,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:22:54,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:22:54,790 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:22:54,790 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:22:54,790 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:22:54,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:22:54,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:22:54,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:22:54,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:22:54,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:22:54,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:22:54,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:22:54,792 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:22:54,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:22:54,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:22:54,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:22:54,793 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:22:54,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:22:54,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:22:54,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:22:54,859 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:22:54,859 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:22:54,860 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-12-03 19:22:54,860 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-12-03 19:22:54,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:22:54,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:22:54,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:22:54,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:22:54,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:22:54,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:54,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:54,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:22:54,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:22:54,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:22:54,981 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:22:54,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:54,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:54,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:54,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:55,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:55,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:55,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... [2018-12-03 19:22:55,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:22:55,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:22:55,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:22:55,023 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:22:55,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:22:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:22:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:22:55,694 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:22:55,694 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 19:22:55,694 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:22:55 BoogieIcfgContainer [2018-12-03 19:22:55,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:22:55,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:22:55,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:22:55,698 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:22:55,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:54" (1/2) ... [2018-12-03 19:22:55,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbf71e1 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:22:55, skipping insertion in model container [2018-12-03 19:22:55,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:22:55" (2/2) ... [2018-12-03 19:22:55,702 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-12-03 19:22:55,712 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:22:55,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:22:55,739 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:22:55,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:22:55,772 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:22:55,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:22:55,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:22:55,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:22:55,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:22:55,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:22:55,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:22:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-03 19:22:55,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:22:55,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:55,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:55,800 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:55,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-12-03 19:22:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:55,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:55,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:55,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:55,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:55,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:55,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:56,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,007 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-12-03 19:22:56,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:56,092 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-12-03 19:22:56,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:56,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 19:22:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:56,107 INFO L225 Difference]: With dead ends: 82 [2018-12-03 19:22:56,107 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 19:22:56,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 19:22:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 19:22:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 19:22:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-12-03 19:22:56,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-12-03 19:22:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:56,156 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-12-03 19:22:56,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-12-03 19:22:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:22:56,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:56,158 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:56,159 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:56,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-12-03 19:22:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:56,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:56,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:56,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:56,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:56,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,252 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-12-03 19:22:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:56,328 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-12-03 19:22:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:56,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 19:22:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:56,334 INFO L225 Difference]: With dead ends: 98 [2018-12-03 19:22:56,334 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 19:22:56,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 19:22:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 19:22:56,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 19:22:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-12-03 19:22:56,351 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-12-03 19:22:56,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:56,351 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-12-03 19:22:56,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-12-03 19:22:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:22:56,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:56,353 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:56,353 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:56,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:56,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-12-03 19:22:56,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:56,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:56,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:56,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:56,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:56,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:56,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:56,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,448 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-12-03 19:22:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:56,548 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-12-03 19:22:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:56,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 19:22:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:56,551 INFO L225 Difference]: With dead ends: 105 [2018-12-03 19:22:56,551 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 19:22:56,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 19:22:56,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 19:22:56,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 19:22:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-12-03 19:22:56,563 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-12-03 19:22:56,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:56,564 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-12-03 19:22:56,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-12-03 19:22:56,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:22:56,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:56,565 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:56,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:56,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:56,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-12-03 19:22:56,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:56,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:56,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:56,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:56,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:56,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:56,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:56,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,643 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-12-03 19:22:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:56,735 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-12-03 19:22:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:56,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 19:22:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:56,737 INFO L225 Difference]: With dead ends: 122 [2018-12-03 19:22:56,737 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:22:56,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:22:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 19:22:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 19:22:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-03 19:22:56,751 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-12-03 19:22:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:56,752 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-03 19:22:56,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-03 19:22:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:22:56,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:56,754 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:56,754 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:56,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:56,755 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-12-03 19:22:56,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:56,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:56,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:56,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:56,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:22:56,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:56,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,864 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-12-03 19:22:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:56,977 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-12-03 19:22:56,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:56,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 19:22:56,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:56,979 INFO L225 Difference]: With dead ends: 145 [2018-12-03 19:22:56,980 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 19:22:56,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 19:22:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 19:22:56,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 19:22:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-12-03 19:22:56,995 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-12-03 19:22:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:56,996 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-12-03 19:22:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-12-03 19:22:56,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:22:56,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:56,998 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:56,998 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:56,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-12-03 19:22:56,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:57,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:57,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:22:57,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:57,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:57,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:57,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,079 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-12-03 19:22:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:57,191 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-12-03 19:22:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:57,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 19:22:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:57,193 INFO L225 Difference]: With dead ends: 235 [2018-12-03 19:22:57,194 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 19:22:57,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 19:22:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-12-03 19:22:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 19:22:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-12-03 19:22:57,232 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-12-03 19:22:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:57,232 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-12-03 19:22:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-12-03 19:22:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:22:57,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:57,242 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:57,242 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:57,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-12-03 19:22:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:57,334 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 19:22:57,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:57,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:57,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:57,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:57,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,338 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-12-03 19:22:57,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:57,395 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-12-03 19:22:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:57,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 19:22:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:57,397 INFO L225 Difference]: With dead ends: 288 [2018-12-03 19:22:57,398 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 19:22:57,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 19:22:57,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 19:22:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 19:22:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-12-03 19:22:57,423 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-12-03 19:22:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:57,423 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-12-03 19:22:57,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-12-03 19:22:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:22:57,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:57,427 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:57,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:57,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:57,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-12-03 19:22:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 19:22:57,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:57,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:22:57,551 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:57,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:57,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,553 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-12-03 19:22:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:57,708 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-12-03 19:22:57,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:57,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 19:22:57,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:57,710 INFO L225 Difference]: With dead ends: 312 [2018-12-03 19:22:57,711 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 19:22:57,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 19:22:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 19:22:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 19:22:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-12-03 19:22:57,735 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-12-03 19:22:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:57,735 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-12-03 19:22:57,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-12-03 19:22:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:22:57,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:57,740 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:57,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:57,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:57,741 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-12-03 19:22:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:57,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:22:57,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:57,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:22:57,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:57,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:57,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:57,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,849 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-12-03 19:22:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:57,943 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-12-03 19:22:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:57,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 19:22:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:57,945 INFO L225 Difference]: With dead ends: 345 [2018-12-03 19:22:57,945 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 19:22:57,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:57,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 19:22:57,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-12-03 19:22:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 19:22:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-12-03 19:22:57,969 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-12-03 19:22:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:57,969 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-12-03 19:22:57,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-12-03 19:22:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:22:57,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:57,971 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:57,972 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:57,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-12-03 19:22:57,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:57,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:22:58,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:58,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:22:58,069 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:58,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:58,071 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-12-03 19:22:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:58,181 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-12-03 19:22:58,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:58,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 19:22:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:58,184 INFO L225 Difference]: With dead ends: 335 [2018-12-03 19:22:58,184 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 19:22:58,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:22:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 19:22:58,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-12-03 19:22:58,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 19:22:58,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-12-03 19:22:58,208 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-12-03 19:22:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:58,208 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-12-03 19:22:58,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-12-03 19:22:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:22:58,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:58,210 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:22:58,210 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:58,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-12-03 19:22:58,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:58,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:58,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:58,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:58,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:22:58,334 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 19:22:58,336 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [16], [22], [26], [32], [34], [38], [44], [46], [50], [56], [58], [60], [62], [66], [68], [72], [76], [83], [85], [89], [95], [97], [101], [105], [109], [113], [119], [121], [127], [131], [137] [2018-12-03 19:22:58,406 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:22:58,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:23:02,088 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 19:23:02,090 INFO L272 AbstractInterpreter]: Visited 35 different actions 72 times. Merged at 22 different actions 30 times. Never widened. Found 7 fixpoints after 5 different actions. Largest state had 0 variables. [2018-12-03 19:23:02,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:02,101 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 19:23:04,371 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 61.24% of their original sizes. [2018-12-03 19:23:04,371 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 19:23:18,833 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-03 19:23:18,833 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 19:23:18,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 19:23:18,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [4] total 41 [2018-12-03 19:23:18,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:23:18,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 19:23:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 19:23:18,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 19:23:18,837 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 39 states. [2018-12-03 19:23:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:56,586 INFO L93 Difference]: Finished difference Result 379 states and 534 transitions. [2018-12-03 19:23:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:23:56,586 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-12-03 19:23:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:56,588 INFO L225 Difference]: With dead ends: 379 [2018-12-03 19:23:56,588 INFO L226 Difference]: Without dead ends: 220 [2018-12-03 19:23:56,590 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 68 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=367, Invalid=2713, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:23:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-03 19:23:56,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2018-12-03 19:23:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 19:23:56,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 283 transitions. [2018-12-03 19:23:56,767 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 283 transitions. Word has length 52 [2018-12-03 19:23:56,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:56,768 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 283 transitions. [2018-12-03 19:23:56,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 19:23:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 283 transitions. [2018-12-03 19:23:56,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:23:56,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:56,769 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:23:56,769 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:56,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:56,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2052781742, now seen corresponding path program 1 times [2018-12-03 19:23:56,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:56,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:56,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:56,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:56,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 19:23:56,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:23:56,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:23:56,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:23:56,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:23:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:23:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:23:56,851 INFO L87 Difference]: Start difference. First operand 212 states and 283 transitions. Second operand 3 states. [2018-12-03 19:23:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:57,069 INFO L93 Difference]: Finished difference Result 416 states and 576 transitions. [2018-12-03 19:23:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:23:57,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 19:23:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:57,071 INFO L225 Difference]: With dead ends: 416 [2018-12-03 19:23:57,071 INFO L226 Difference]: Without dead ends: 276 [2018-12-03 19:23:57,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:23:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-03 19:23:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 201. [2018-12-03 19:23:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 19:23:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 270 transitions. [2018-12-03 19:23:57,230 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 270 transitions. Word has length 52 [2018-12-03 19:23:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:57,231 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 270 transitions. [2018-12-03 19:23:57,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:23:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 270 transitions. [2018-12-03 19:23:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:23:57,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:57,232 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:23:57,232 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:57,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1132381358, now seen corresponding path program 1 times [2018-12-03 19:23:57,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:57,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:23:57,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:57,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 19:23:57,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:57,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:23:57,330 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-03 19:23:57,331 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [60], [62], [66], [68], [72], [74], [76], [81], [83], [85], [89], [95], [97], [101], [105], [109], [111], [113], [117], [119], [121], [125], [127], [131], [137], [139] [2018-12-03 19:23:57,338 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:23:57,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:24:08,233 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 19:24:08,233 INFO L272 AbstractInterpreter]: Visited 46 different actions 395 times. Merged at 35 different actions 217 times. Widened at 29 different actions 95 times. Found 50 fixpoints after 22 different actions. Largest state had 0 variables. [2018-12-03 19:24:08,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:24:08,241 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 19:24:09,617 INFO L227 lantSequenceWeakener]: Weakened 73 states. On average, predicates are now at 52.24% of their original sizes. [2018-12-03 19:24:09,618 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 19:24:36,963 INFO L418 sIntCurrentIteration]: We unified 74 AI predicates to 74 [2018-12-03 19:24:36,963 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 19:24:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 19:24:36,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [4] total 63 [2018-12-03 19:24:36,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:24:36,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 19:24:36,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 19:24:36,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3450, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 19:24:36,968 INFO L87 Difference]: Start difference. First operand 201 states and 270 transitions. Second operand 61 states. [2018-12-03 19:25:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:41,433 INFO L93 Difference]: Finished difference Result 400 states and 543 transitions. [2018-12-03 19:25:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:25:41,433 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 75 [2018-12-03 19:25:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:41,434 INFO L225 Difference]: With dead ends: 400 [2018-12-03 19:25:41,434 INFO L226 Difference]: Without dead ends: 233 [2018-12-03 19:25:41,437 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 42.7s TimeCoverageRelationStatistics Valid=583, Invalid=6389, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 19:25:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-03 19:25:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2018-12-03 19:25:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 19:25:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2018-12-03 19:25:41,689 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 75 [2018-12-03 19:25:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:41,690 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2018-12-03 19:25:41,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 19:25:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2018-12-03 19:25:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:25:41,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:41,691 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:25:41,691 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:41,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:41,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-12-03 19:25:41,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:41,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:41,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:41,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 19:25:41,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:25:41,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 19:25:41,788 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:25:41,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:25:41,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:25:41,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:25:41,789 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 3 states. [2018-12-03 19:25:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:25:42,229 INFO L93 Difference]: Finished difference Result 561 states and 761 transitions. [2018-12-03 19:25:42,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:25:42,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 19:25:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:25:42,232 INFO L225 Difference]: With dead ends: 561 [2018-12-03 19:25:42,232 INFO L226 Difference]: Without dead ends: 344 [2018-12-03 19:25:42,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:25:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-03 19:25:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-12-03 19:25:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-03 19:25:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 454 transitions. [2018-12-03 19:25:42,715 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 454 transitions. Word has length 75 [2018-12-03 19:25:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:25:42,715 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 454 transitions. [2018-12-03 19:25:42,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:25:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 454 transitions. [2018-12-03 19:25:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:25:42,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:25:42,717 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 19:25:42,717 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:25:42,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:25:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-12-03 19:25:42,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:25:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:42,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:25:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:25:42,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:25:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:25:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 19:25:43,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:25:43,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:25:43,113 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-03 19:25:43,114 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [60], [62], [66], [68], [72], [74], [76], [81], [83], [85], [89], [91], [95], [97], [101], [103], [105], [109], [111], [113], [117], [119], [121], [125], [127], [131], [133], [137], [139] [2018-12-03 19:25:43,117 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:25:43,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)