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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:02:12,355 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:02:12,357 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:02:12,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:02:12,375 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:02:12,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:02:12,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:02:12,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:02:12,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:02:12,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:02:12,385 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:02:12,385 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:02:12,386 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:02:12,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:02:12,388 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:02:12,389 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:02:12,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:02:12,392 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:02:12,394 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:02:12,395 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:02:12,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:02:12,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:02:12,402 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:02:12,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:02:12,403 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:02:12,406 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:02:12,408 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:02:12,411 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:02:12,412 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:02:12,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:02:12,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:02:12,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:02:12,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:02:12,415 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:02:12,416 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:02:12,418 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:02:12,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:02:12,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:02:12,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:02:12,446 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:02:12,446 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:02:12,446 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:02:12,447 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:02:12,447 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:02:12,447 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:02:12,447 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:02:12,447 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:02:12,447 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:02:12,448 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:02:12,448 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:02:12,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:02:12,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:02:12,449 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:02:12,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:02:12,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:02:12,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:02:12,450 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:02:12,450 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:02:12,450 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:02:12,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:02:12,450 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:02:12,451 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:02:12,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:02:12,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:02:12,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:02:12,453 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:02:12,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:02:12,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:02:12,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:02:12,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:02:12,454 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:02:12,455 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:02:12,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:02:12,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:02:12,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:02:12,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:02:12,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:02:12,528 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:02:12,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:02:12,536 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:02:12,537 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:02:12,538 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 18:02:12,538 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-12-03 18:02:12,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:02:12,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:02:12,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:02:12,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:02:12,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:02:12,649 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,662 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:02:12,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:02:12,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:02:12,673 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:02:12,685 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,685 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,688 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,689 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,698 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,701 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,704 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 06:02:12" (1/1) ... [2018-12-03 18:02:12,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:02:12,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:02:12,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:02:12,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:02:12,710 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 06:02:12" (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 18:02:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:02:12,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:02:13,528 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:02:13,529 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 18:02:13,529 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:02:13 BoogieIcfgContainer [2018-12-03 18:02:13,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:02:13,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:02:13,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:02:13,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:02:13,534 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 06:02:12" (1/2) ... [2018-12-03 18:02:13,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212d7981 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:02:13, skipping insertion in model container [2018-12-03 18:02:13,536 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 06:02:13" (2/2) ... [2018-12-03 18:02:13,538 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-12-03 18:02:13,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:02:13,557 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:02:13,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:02:13,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:02:13,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:02:13,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:02:13,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:02:13,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:02:13,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:02:13,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:02:13,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:02:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-03 18:02:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:02:13,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:13,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:02:13,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:13,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:13,645 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-12-03 18:02:13,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:13,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:13,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:13,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:13,846 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 18:02:13,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:13,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:13,848 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:13,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:13,867 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-12-03 18:02:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:13,945 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-12-03 18:02:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:13,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 18:02:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:13,961 INFO L225 Difference]: With dead ends: 82 [2018-12-03 18:02:13,961 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:02:13,965 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 18:02:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:02:14,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:02:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:02:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-12-03 18:02:14,014 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-12-03 18:02:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:14,015 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-12-03 18:02:14,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-12-03 18:02:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:02:14,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:14,017 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:02:14,017 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:14,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-12-03 18:02:14,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:14,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:14,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:14,104 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 18:02:14,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:14,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:14,105 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:14,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:14,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:14,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:14,108 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-12-03 18:02:14,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:14,176 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-12-03 18:02:14,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:14,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 18:02:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:14,180 INFO L225 Difference]: With dead ends: 98 [2018-12-03 18:02:14,180 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:02:14,183 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 18:02:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:02:14,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:02:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:02:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-12-03 18:02:14,209 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-12-03 18:02:14,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:14,209 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-12-03 18:02:14,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-12-03 18:02:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:02:14,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:14,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 18:02:14,211 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:14,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:14,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-12-03 18:02:14,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:14,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:14,305 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 18:02:14,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:14,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:14,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:14,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:14,311 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-12-03 18:02:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:14,386 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-12-03 18:02:14,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:14,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 18:02:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:14,389 INFO L225 Difference]: With dead ends: 105 [2018-12-03 18:02:14,390 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:02:14,391 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 18:02:14,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:02:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 18:02:14,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:02:14,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-12-03 18:02:14,403 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-12-03 18:02:14,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:14,404 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-12-03 18:02:14,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:14,404 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-12-03 18:02:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:02:14,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:14,406 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 18:02:14,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:14,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:14,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-12-03 18:02:14,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:14,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:14,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:14,467 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 18:02:14,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:14,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:14,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:14,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:14,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:14,473 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-12-03 18:02:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:14,559 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-12-03 18:02:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:14,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 18:02:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:14,560 INFO L225 Difference]: With dead ends: 122 [2018-12-03 18:02:14,561 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:02:14,562 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 18:02:14,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:02:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 18:02:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 18:02:14,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-03 18:02:14,574 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-12-03 18:02:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:14,575 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-03 18:02:14,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-03 18:02:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:02:14,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:14,576 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 18:02:14,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:14,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-12-03 18:02:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:14,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:14,664 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 18:02:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:14,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:02:14,665 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:14,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:14,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:14,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:14,666 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-12-03 18:02:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:14,847 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-12-03 18:02:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:14,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 18:02:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:14,854 INFO L225 Difference]: With dead ends: 145 [2018-12-03 18:02:14,854 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 18:02:14,855 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 18:02:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 18:02:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 18:02:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 18:02:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-12-03 18:02:14,886 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-12-03 18:02:14,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:14,886 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-12-03 18:02:14,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-12-03 18:02:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:02:14,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:14,892 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 18:02:14,894 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:14,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-12-03 18:02:14,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:14,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:14,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,030 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 18:02:15,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:15,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:02:15,031 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:15,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:15,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:15,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:15,032 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-12-03 18:02:15,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:15,139 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-12-03 18:02:15,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:15,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 18:02:15,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:15,142 INFO L225 Difference]: With dead ends: 235 [2018-12-03 18:02:15,142 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 18:02:15,146 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 18:02:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 18:02:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-12-03 18:02:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 18:02:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-12-03 18:02:15,186 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-12-03 18:02:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-12-03 18:02:15,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-12-03 18:02:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:02:15,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:15,189 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 18:02:15,189 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:15,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-12-03 18:02:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,280 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 18:02:15,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:15,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:15,281 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:15,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:15,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:15,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:15,283 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-12-03 18:02:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:15,357 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-12-03 18:02:15,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:15,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 18:02:15,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:15,360 INFO L225 Difference]: With dead ends: 288 [2018-12-03 18:02:15,360 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 18:02:15,361 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 18:02:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 18:02:15,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 18:02:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 18:02:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-12-03 18:02:15,394 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-12-03 18:02:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:15,395 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-12-03 18:02:15,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-12-03 18:02:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:02:15,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:15,402 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 18:02:15,403 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:15,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:15,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-12-03 18:02:15,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:15,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,499 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 18:02:15,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:15,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:02:15,500 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:15,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:15,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:15,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:15,501 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-12-03 18:02:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:15,587 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-12-03 18:02:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:15,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 18:02:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:15,590 INFO L225 Difference]: With dead ends: 312 [2018-12-03 18:02:15,590 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 18:02:15,591 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 18:02:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 18:02:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 18:02:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 18:02:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-12-03 18:02:15,623 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-12-03 18:02:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:15,623 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-12-03 18:02:15,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-12-03 18:02:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:02:15,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:15,631 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 18:02:15,631 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:15,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-12-03 18:02:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,734 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 18:02:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:15,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:02:15,735 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:15,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:15,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:15,737 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-12-03 18:02:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:15,839 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-12-03 18:02:15,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:15,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 18:02:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:15,842 INFO L225 Difference]: With dead ends: 345 [2018-12-03 18:02:15,842 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 18:02:15,843 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 18:02:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 18:02:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-12-03 18:02:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 18:02:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-12-03 18:02:15,865 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-12-03 18:02:15,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:15,866 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-12-03 18:02:15,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-12-03 18:02:15,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:02:15,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:15,867 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 18:02:15,867 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:15,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-12-03 18:02:15,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:15,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:15,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:15,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:15,960 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 18:02:15,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:02:15,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:02:15,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:15,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:02:15,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:02:15,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:02:15,963 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-12-03 18:02:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:02:16,060 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-12-03 18:02:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:02:16,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 18:02:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:02:16,063 INFO L225 Difference]: With dead ends: 335 [2018-12-03 18:02:16,063 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 18:02:16,064 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 18:02:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 18:02:16,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-12-03 18:02:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 18:02:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-12-03 18:02:16,084 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-12-03 18:02:16,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:02:16,085 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-12-03 18:02:16,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:02:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-12-03 18:02:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:02:16,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:02:16,086 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 18:02:16,087 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:02:16,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-12-03 18:02:16,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:02:16,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:16,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:02:16,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:02:16,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:02:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:02:16,251 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 18:02:16,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:02:16,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:02:16,253 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 18:02:16,256 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 18:02:16,346 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:02:16,346 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:02:31,603 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:02:31,605 INFO L272 AbstractInterpreter]: Visited 35 different actions 210 times. Merged at 32 different actions 144 times. Widened at 17 different actions 40 times. Found 21 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 18:02:31,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:02:31,654 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:02:33,347 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 60.9% of their original sizes. [2018-12-03 18:02:33,347 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:02:44,815 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-03 18:02:44,816 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:02:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:02:44,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [4] total 43 [2018-12-03 18:02:44,817 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:02:44,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:02:44,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:02:44,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1468, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:02:44,819 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 41 states. [2018-12-03 18:03:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:28,268 INFO L93 Difference]: Finished difference Result 459 states and 643 transitions. [2018-12-03 18:03:28,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:03:28,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 52 [2018-12-03 18:03:28,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:28,271 INFO L225 Difference]: With dead ends: 459 [2018-12-03 18:03:28,272 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 18:03:28,275 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 85 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=634, Invalid=4916, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 18:03:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 18:03:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 262. [2018-12-03 18:03:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-03 18:03:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 341 transitions. [2018-12-03 18:03:28,547 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 341 transitions. Word has length 52 [2018-12-03 18:03:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:28,547 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 341 transitions. [2018-12-03 18:03:28,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:03:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 341 transitions. [2018-12-03 18:03:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:03:28,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:28,549 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 18:03:28,549 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:28,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash 984560426, now seen corresponding path program 1 times [2018-12-03 18:03:28,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:28,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:28,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:28,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:28,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 18:03:28,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:03:28,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:03:28,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:03:28,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:03:28,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:03:28,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:03:28,648 INFO L87 Difference]: Start difference. First operand 262 states and 341 transitions. Second operand 3 states. [2018-12-03 18:03:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:28,866 INFO L93 Difference]: Finished difference Result 435 states and 583 transitions. [2018-12-03 18:03:28,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:03:28,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 18:03:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:28,868 INFO L225 Difference]: With dead ends: 435 [2018-12-03 18:03:28,868 INFO L226 Difference]: Without dead ends: 217 [2018-12-03 18:03:28,868 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 18:03:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-12-03 18:03:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 212. [2018-12-03 18:03:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-03 18:03:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 282 transitions. [2018-12-03 18:03:29,023 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 282 transitions. Word has length 52 [2018-12-03 18:03:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:29,024 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 282 transitions. [2018-12-03 18:03:29,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:03:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 282 transitions. [2018-12-03 18:03:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:03:29,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:29,025 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 18:03:29,026 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:29,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-12-03 18:03:29,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:29,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:29,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:29,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:29,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:29,076 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 18:03:29,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:03:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 18:03:29,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:03:29,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:03:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:03:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:03:29,078 INFO L87 Difference]: Start difference. First operand 212 states and 282 transitions. Second operand 3 states. [2018-12-03 18:03:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:29,350 INFO L93 Difference]: Finished difference Result 504 states and 684 transitions. [2018-12-03 18:03:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:03:29,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 18:03:29,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:29,353 INFO L225 Difference]: With dead ends: 504 [2018-12-03 18:03:29,353 INFO L226 Difference]: Without dead ends: 284 [2018-12-03 18:03:29,354 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 18:03:29,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-03 18:03:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-12-03 18:03:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-12-03 18:03:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 375 transitions. [2018-12-03 18:03:29,562 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 375 transitions. Word has length 75 [2018-12-03 18:03:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:29,562 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 375 transitions. [2018-12-03 18:03:29,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:03:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 375 transitions. [2018-12-03 18:03:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:03:29,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:29,564 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 18:03:29,564 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:29,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:29,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-12-03 18:03:29,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:29,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:03:29,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:29,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:30,486 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 18:03:30,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:30,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:30,487 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-03 18:03:30,488 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 18:03:30,492 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:03:30,492 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)