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/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 22:08:14,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 22:08:14,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 22:08:14,575 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 22:08:14,576 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 22:08:14,577 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 22:08:14,578 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 22:08:14,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 22:08:14,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 22:08:14,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 22:08:14,584 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 22:08:14,584 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 22:08:14,585 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 22:08:14,587 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 22:08:14,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 22:08:14,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 22:08:14,590 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 22:08:14,592 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 22:08:14,594 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 22:08:14,596 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 22:08:14,597 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 22:08:14,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 22:08:14,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 22:08:14,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 22:08:14,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 22:08:14,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 22:08:14,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 22:08:14,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 22:08:14,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 22:08:14,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 22:08:14,612 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 22:08:14,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 22:08:14,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 22:08:14,613 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 22:08:14,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 22:08:14,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 22:08:14,620 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 22:08:14,647 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 22:08:14,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 22:08:14,649 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 22:08:14,649 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 22:08:14,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 22:08:14,649 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 22:08:14,650 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 22:08:14,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 22:08:14,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 22:08:14,651 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 22:08:14,651 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 22:08:14,651 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 22:08:14,651 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 22:08:14,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 22:08:14,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 22:08:14,654 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 22:08:14,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 22:08:14,654 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 22:08:14,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 22:08:14,655 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 22:08:14,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 22:08:14,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 22:08:14,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 22:08:14,658 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 22:08:14,658 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 22:08:14,658 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 22:08:14,659 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 22:08:14,659 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 22:08:14,659 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 22:08:14,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 22:08:14,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:08:14,660 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 22:08:14,660 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 22:08:14,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 22:08:14,660 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 22:08:14,661 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 22:08:14,661 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 22:08:14,662 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 22:08:14,662 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 22:08:14,695 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 22:08:14,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 22:08:14,718 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 22:08:14,720 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 22:08:14,721 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 22:08:14,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-07 22:08:14,723 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-07 22:08:14,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 22:08:14,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 22:08:14,788 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 22:08:14,788 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 22:08:14,788 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 22:08:14,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,831 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 22:08:14,832 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 22:08:14,832 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 22:08:14,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 22:08:14,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 22:08:14,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 22:08:14,858 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 22:08:14,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... [2019-01-07 22:08:14,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 22:08:14,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 22:08:14,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 22:08:14,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 22:08:14,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 22:08:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-07 22:08:14,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 22:08:14,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 22:08:14,974 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-07 22:08:15,334 INFO L278 CfgBuilder]: Using library mode [2019-01-07 22:08:15,334 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-07 22:08:15,335 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:08:15 BoogieIcfgContainer [2019-01-07 22:08:15,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 22:08:15,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 22:08:15,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 22:08:15,340 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 22:08:15,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 10:08:14" (1/2) ... [2019-01-07 22:08:15,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac07672 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 10:08:15, skipping insertion in model container [2019-01-07 22:08:15,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 10:08:15" (2/2) ... [2019-01-07 22:08:15,344 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-07 22:08:15,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 22:08:15,378 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-07 22:08:15,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-07 22:08:15,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 22:08:15,439 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 22:08:15,439 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 22:08:15,439 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 22:08:15,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 22:08:15,439 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 22:08:15,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 22:08:15,440 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 22:08:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 22:08:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 22:08:15,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:15,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 22:08:15,480 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:08:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-07 22:08:15,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:08:15,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:15,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:08:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:08:15,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:08:15,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 22:08:15,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:08:15,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 22:08:15,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 22:08:15,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 22:08:15,732 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-07 22:08:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:15,881 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-07 22:08:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 22:08:15,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 22:08:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:15,895 INFO L225 Difference]: With dead ends: 20 [2019-01-07 22:08:15,895 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 22:08:15,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 22:08:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 22:08:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-07 22:08:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 22:08:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 22:08:15,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-07 22:08:15,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:15,931 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 22:08:15,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 22:08:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 22:08:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 22:08:15,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:15,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 22:08:15,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:08:15,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:15,933 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-07 22:08:15,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:15,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:15,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:08:15,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:15,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:08:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:08:16,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:08:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 22:08:16,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:08:16,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 22:08:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 22:08:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-07 22:08:16,105 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-07 22:08:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:16,292 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-07 22:08:16,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 22:08:16,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-07 22:08:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:16,294 INFO L225 Difference]: With dead ends: 17 [2019-01-07 22:08:16,294 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 22:08:16,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-07 22:08:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 22:08:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-07 22:08:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 22:08:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-07 22:08:16,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-07 22:08:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:16,311 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-07 22:08:16,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 22:08:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 22:08:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 22:08:16,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:16,312 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-07 22:08:16,313 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:08:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-07 22:08:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:16,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:08:16,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:16,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:08:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:08:16,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 22:08:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 22:08:16,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 22:08:16,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 22:08:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 22:08:16,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 22:08:16,372 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-07 22:08:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:16,391 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-07 22:08:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 22:08:16,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-07 22:08:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:16,393 INFO L225 Difference]: With dead ends: 18 [2019-01-07 22:08:16,393 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 22:08:16,394 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 [2019-01-07 22:08:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 22:08:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 22:08:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 22:08:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 22:08:16,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-07 22:08:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:16,400 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 22:08:16,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 22:08:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 22:08:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 22:08:16,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:16,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-07 22:08:16,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:08:16,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:16,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-07 22:08:16,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:16,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:16,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:08:16,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:16,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:08:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:08:16,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:08:16,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:08:16,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-07 22:08:16,667 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-07 22:08:16,727 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 22:08:16,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 22:09:24,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 22:09:24,479 INFO L272 AbstractInterpreter]: Visited 7 different actions 85 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 22:09:24,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:24,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 22:09:24,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:24,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:24,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:24,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:24,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:24,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:24,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:24,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:24,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:25,260 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-07 22:09:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:25,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:25,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:25,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 22:09:25,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:25,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 22:09:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 22:09:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-07 22:09:25,762 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-07 22:09:26,063 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-07 22:09:26,504 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-07 22:09:26,813 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-07 22:09:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:27,093 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-07 22:09:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 22:09:27,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-07 22:09:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:27,094 INFO L225 Difference]: With dead ends: 20 [2019-01-07 22:09:27,094 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 22:09:27,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 22:09:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 22:09:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-07 22:09:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 22:09:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-07 22:09:27,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-07 22:09:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:27,100 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-07 22:09:27,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 22:09:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-07 22:09:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-07 22:09:27,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:27,101 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-07 22:09:27,102 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-07 22:09:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:27,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:27,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:27,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:27,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:27,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:27,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:27,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:27,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:27,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:27,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 22:09:27,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:27,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:27,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:27,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:27,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:27,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:27,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 22:09:27,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 22:09:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 22:09:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-07 22:09:27,887 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-07 22:09:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:28,077 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-07 22:09:28,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 22:09:28,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-07 22:09:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:28,081 INFO L225 Difference]: With dead ends: 25 [2019-01-07 22:09:28,082 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 22:09:28,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-07 22:09:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 22:09:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-07 22:09:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 22:09:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-07 22:09:28,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-07 22:09:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:28,087 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-07 22:09:28,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 22:09:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-07 22:09:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 22:09:28,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:28,088 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-07 22:09:28,089 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-07 22:09:28,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:28,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:28,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:28,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:28,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:28,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:28,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:28,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:28,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:28,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:28,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:28,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:28,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:28,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:28,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:28,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:28,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:28,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:28,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 22:09:28,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:28,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 22:09:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 22:09:28,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 22:09:28,899 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-07 22:09:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:29,098 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-07 22:09:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 22:09:29,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-07 22:09:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:29,101 INFO L225 Difference]: With dead ends: 30 [2019-01-07 22:09:29,101 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 22:09:29,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-07 22:09:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 22:09:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-07 22:09:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 22:09:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-07 22:09:29,107 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-07 22:09:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-07 22:09:29,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 22:09:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-07 22:09:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-07 22:09:29,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:29,108 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-07 22:09:29,109 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:29,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-07 22:09:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:29,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:29,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:29,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:29,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:29,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:29,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:29,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:29,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:29,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:29,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:29,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:29,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:29,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:29,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:29,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:29,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:29,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 22:09:29,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:29,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 22:09:29,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 22:09:29,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 22:09:29,542 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-07 22:09:29,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:29,800 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-07 22:09:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 22:09:29,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-07 22:09:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:29,802 INFO L225 Difference]: With dead ends: 35 [2019-01-07 22:09:29,802 INFO L226 Difference]: Without dead ends: 34 [2019-01-07 22:09:29,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-07 22:09:29,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-07 22:09:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-07 22:09:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 22:09:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-07 22:09:29,809 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-07 22:09:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:29,809 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-07 22:09:29,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 22:09:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-07 22:09:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 22:09:29,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:29,810 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-07 22:09:29,811 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-07 22:09:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:29,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:29,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:29,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:29,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:29,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:29,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:29,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:29,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:29,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-07 22:09:29,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:29,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:29,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:29,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:30,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:30,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:30,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:30,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:30,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-07 22:09:30,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:30,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 22:09:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 22:09:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-07 22:09:30,350 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-07 22:09:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:30,788 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-07 22:09:30,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 22:09:30,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-07 22:09:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:30,791 INFO L225 Difference]: With dead ends: 40 [2019-01-07 22:09:30,791 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 22:09:30,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-07 22:09:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 22:09:30,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-07 22:09:30,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 22:09:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-07 22:09:30,798 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-07 22:09:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:30,798 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-07 22:09:30,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 22:09:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-07 22:09:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-07 22:09:30,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:30,800 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-07 22:09:30,800 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-07 22:09:30,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:30,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:30,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:31,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:31,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:31,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:31,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:31,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:31,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:31,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:31,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:31,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:31,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:31,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:31,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:31,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:31,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:31,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:31,421 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:31,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:31,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-07 22:09:31,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:31,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 22:09:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 22:09:31,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-07 22:09:31,442 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-07 22:09:31,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:31,733 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-07 22:09:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 22:09:31,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-07 22:09:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:31,735 INFO L225 Difference]: With dead ends: 45 [2019-01-07 22:09:31,735 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 22:09:31,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 22:09:31,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 22:09:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-07 22:09:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 22:09:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-07 22:09:31,744 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-07 22:09:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:31,744 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-07 22:09:31,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 22:09:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-07 22:09:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-07 22:09:31,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:31,745 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-07 22:09:31,746 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:31,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-07 22:09:31,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:31,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:31,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:31,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:31,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:31,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:31,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:31,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:31,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:31,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:31,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:31,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:31,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:31,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:32,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:32,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:32,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-07 22:09:32,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:32,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 22:09:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 22:09:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-07 22:09:32,433 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-07 22:09:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:32,805 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-07 22:09:32,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 22:09:32,806 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-07 22:09:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:32,807 INFO L225 Difference]: With dead ends: 50 [2019-01-07 22:09:32,807 INFO L226 Difference]: Without dead ends: 49 [2019-01-07 22:09:32,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 22:09:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-07 22:09:32,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-07 22:09:32,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 22:09:32,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-07 22:09:32,817 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-07 22:09:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:32,817 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-07 22:09:32,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 22:09:32,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-07 22:09:32,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-07 22:09:32,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:32,818 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-07 22:09:32,819 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:32,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-07 22:09:32,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:32,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:32,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:32,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:32,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:32,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:32,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:32,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:32,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:32,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:32,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:33,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:33,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:33,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-07 22:09:33,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:33,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:33,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:33,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:33,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:33,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:33,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:33,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:33,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-07 22:09:33,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:33,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 22:09:33,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 22:09:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-07 22:09:33,504 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-07 22:09:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:33,815 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-07 22:09:33,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 22:09:33,816 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-07 22:09:33,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:33,817 INFO L225 Difference]: With dead ends: 55 [2019-01-07 22:09:33,817 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 22:09:33,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 22:09:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 22:09:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-07 22:09:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-07 22:09:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-07 22:09:33,827 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-07 22:09:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:33,827 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-07 22:09:33,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 22:09:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-07 22:09:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-07 22:09:33,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:33,828 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-07 22:09:33,829 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:33,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:33,829 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-07 22:09:33,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:33,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:33,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:33,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:33,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:34,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:34,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:34,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:34,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:34,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:34,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:34,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:34,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:34,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:34,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:34,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:34,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:34,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:34,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:34,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:34,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:34,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-07 22:09:34,681 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:34,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-07 22:09:34,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-07 22:09:34,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-07 22:09:34,682 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-07 22:09:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:35,059 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-07 22:09:35,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 22:09:35,059 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-07 22:09:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:35,061 INFO L225 Difference]: With dead ends: 60 [2019-01-07 22:09:35,061 INFO L226 Difference]: Without dead ends: 59 [2019-01-07 22:09:35,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 22:09:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-07 22:09:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-07 22:09:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-07 22:09:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-07 22:09:35,072 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-07 22:09:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:35,072 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-07 22:09:35,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-07 22:09:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-07 22:09:35,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-07 22:09:35,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:35,074 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-07 22:09:35,074 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:35,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:35,074 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-07 22:09:35,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:35,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:35,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:35,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:35,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:35,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:35,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:35,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:35,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:35,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:35,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:35,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:35,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:35,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:35,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:35,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:35,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:36,046 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:36,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:36,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-07 22:09:36,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:36,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 22:09:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 22:09:36,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 22:09:36,067 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-07 22:09:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:36,543 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-07 22:09:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 22:09:36,544 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-07 22:09:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:36,545 INFO L225 Difference]: With dead ends: 65 [2019-01-07 22:09:36,545 INFO L226 Difference]: Without dead ends: 64 [2019-01-07 22:09:36,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 22:09:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-07 22:09:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-07 22:09:36,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 22:09:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-07 22:09:36,558 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-07 22:09:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:36,558 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-07 22:09:36,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 22:09:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-07 22:09:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-07 22:09:36,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:36,563 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-07 22:09:36,563 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-07 22:09:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:36,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:37,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:37,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:37,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:37,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:37,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:37,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:37,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-07 22:09:37,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:37,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:37,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:37,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:37,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:37,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:37,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:38,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-07 22:09:38,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 22:09:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 22:09:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-07 22:09:38,070 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-07 22:09:38,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:38,589 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-07 22:09:38,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 22:09:38,590 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-07 22:09:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:38,590 INFO L225 Difference]: With dead ends: 70 [2019-01-07 22:09:38,590 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 22:09:38,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 22:09:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 22:09:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-07 22:09:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-07 22:09:38,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-07 22:09:38,602 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-07 22:09:38,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:38,602 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-07 22:09:38,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 22:09:38,603 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-07 22:09:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-07 22:09:38,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:38,604 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-07 22:09:38,604 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-07 22:09:38,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:38,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:38,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:38,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:39,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:39,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:39,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:39,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:39,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:39,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:39,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:39,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:39,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:39,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:39,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:39,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:39,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:39,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:39,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:39,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:40,200 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:40,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:40,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-07 22:09:40,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:40,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-07 22:09:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-07 22:09:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 22:09:40,221 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-07 22:09:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:40,817 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-07 22:09:40,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 22:09:40,818 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-07 22:09:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:40,819 INFO L225 Difference]: With dead ends: 75 [2019-01-07 22:09:40,819 INFO L226 Difference]: Without dead ends: 74 [2019-01-07 22:09:40,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 22:09:40,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-07 22:09:40,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-07 22:09:40,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 22:09:40,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-07 22:09:40,832 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-07 22:09:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:40,832 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-07 22:09:40,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-07 22:09:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-07 22:09:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-07 22:09:40,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:40,837 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-07 22:09:40,837 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-07 22:09:40,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:40,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:40,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:40,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:41,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:41,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:41,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:41,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:41,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:41,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:41,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:41,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:41,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:41,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:41,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:41,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:41,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:41,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:42,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:42,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-07 22:09:42,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:42,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 22:09:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 22:09:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-07 22:09:42,670 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-07 22:09:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:43,206 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-07 22:09:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 22:09:43,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-07 22:09:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:43,207 INFO L225 Difference]: With dead ends: 80 [2019-01-07 22:09:43,208 INFO L226 Difference]: Without dead ends: 79 [2019-01-07 22:09:43,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 22:09:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-07 22:09:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-07 22:09:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-07 22:09:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-07 22:09:43,219 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-07 22:09:43,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:43,220 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-07 22:09:43,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 22:09:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-07 22:09:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-07 22:09:43,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:43,221 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-07 22:09:43,221 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-07 22:09:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:43,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:43,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:43,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:43,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:43,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:43,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:43,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:43,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:43,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:43,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:43,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:43,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:43,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-07 22:09:43,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:43,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:43,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:43,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:43,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:43,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:44,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:44,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:44,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-07 22:09:44,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:44,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 22:09:44,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 22:09:44,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 22:09:44,445 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-07 22:09:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:44,967 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-07 22:09:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 22:09:44,967 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-07 22:09:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:44,968 INFO L225 Difference]: With dead ends: 85 [2019-01-07 22:09:44,969 INFO L226 Difference]: Without dead ends: 84 [2019-01-07 22:09:44,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 22:09:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-07 22:09:44,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-07 22:09:44,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-07 22:09:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-07 22:09:44,984 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-07 22:09:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:44,984 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-07 22:09:44,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 22:09:44,985 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-07 22:09:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-07 22:09:44,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:44,986 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-07 22:09:44,986 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:44,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-07 22:09:44,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:44,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:44,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:45,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:45,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:45,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:45,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:45,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:45,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:45,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:45,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:45,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:45,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:45,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:45,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:45,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:45,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:45,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:47,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:47,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:47,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-07 22:09:47,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:47,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-07 22:09:47,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-07 22:09:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 22:09:47,431 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-07 22:09:48,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:48,047 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-07 22:09:48,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 22:09:48,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-07 22:09:48,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:48,048 INFO L225 Difference]: With dead ends: 90 [2019-01-07 22:09:48,048 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 22:09:48,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 22:09:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 22:09:48,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-07 22:09:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-07 22:09:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-07 22:09:48,064 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-07 22:09:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:48,064 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-07 22:09:48,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-07 22:09:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-07 22:09:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-07 22:09:48,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:48,066 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-07 22:09:48,066 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-07 22:09:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:48,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:48,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:48,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:48,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:48,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:48,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:48,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:48,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:48,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:48,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:48,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:48,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:48,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:48,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:48,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:48,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:49,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:49,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-07 22:09:49,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:49,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 22:09:49,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 22:09:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 22:09:49,391 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-07 22:09:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:49,973 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-07 22:09:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 22:09:49,973 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-07 22:09:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:49,974 INFO L225 Difference]: With dead ends: 95 [2019-01-07 22:09:49,974 INFO L226 Difference]: Without dead ends: 94 [2019-01-07 22:09:49,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 22:09:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-07 22:09:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-07 22:09:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 22:09:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-07 22:09:49,986 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-07 22:09:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:49,986 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-07 22:09:49,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 22:09:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-07 22:09:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-07 22:09:49,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:49,987 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-07 22:09:49,987 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:49,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-07 22:09:49,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:49,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:49,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:49,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:49,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:51,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:51,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:51,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:51,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:51,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:51,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:51,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-07 22:09:51,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:51,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:51,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:51,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:51,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:51,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:51,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:52,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:52,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-07 22:09:52,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:52,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 22:09:52,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 22:09:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 22:09:52,328 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-07 22:09:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:52,982 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-07 22:09:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 22:09:52,983 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-07 22:09:52,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:52,984 INFO L225 Difference]: With dead ends: 100 [2019-01-07 22:09:52,985 INFO L226 Difference]: Without dead ends: 99 [2019-01-07 22:09:52,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 22:09:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-07 22:09:52,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-07 22:09:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-07 22:09:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-07 22:09:53,000 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-07 22:09:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:53,000 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-07 22:09:53,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 22:09:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-07 22:09:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-07 22:09:53,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:53,002 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-07 22:09:53,002 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:53,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:53,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-07 22:09:53,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:53,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:53,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:53,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:53,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:53,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:53,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:53,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:53,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:53,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:53,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:09:53,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:09:53,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:09:53,514 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:53,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:53,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:53,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:53,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:53,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:53,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:54,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-07 22:09:54,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:54,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-07 22:09:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-07 22:09:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 22:09:54,477 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-07 22:09:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:55,169 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-07 22:09:55,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 22:09:55,169 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-07 22:09:55,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:55,171 INFO L225 Difference]: With dead ends: 105 [2019-01-07 22:09:55,171 INFO L226 Difference]: Without dead ends: 104 [2019-01-07 22:09:55,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 22:09:55,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-07 22:09:55,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-07 22:09:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 22:09:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-07 22:09:55,182 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-07 22:09:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:55,182 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-07 22:09:55,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-07 22:09:55,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-07 22:09:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-07 22:09:55,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:55,183 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-07 22:09:55,184 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:55,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:55,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-07 22:09:55,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:55,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:09:55,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:55,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:55,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:55,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:55,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:55,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:55,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:55,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:55,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:09:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:55,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:55,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:55,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:55,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:55,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:09:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:56,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:09:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:57,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:09:57,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-07 22:09:57,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:09:57,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 22:09:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 22:09:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 22:09:57,229 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-07 22:09:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:09:58,013 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-07 22:09:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-07 22:09:58,018 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-07 22:09:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:09:58,019 INFO L225 Difference]: With dead ends: 110 [2019-01-07 22:09:58,019 INFO L226 Difference]: Without dead ends: 109 [2019-01-07 22:09:58,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 22:09:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-07 22:09:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-07 22:09:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-07 22:09:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-07 22:09:58,032 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-07 22:09:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:09:58,032 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-07 22:09:58,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 22:09:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-07 22:09:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-07 22:09:58,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:09:58,033 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-07 22:09:58,033 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:09:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:09:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-07 22:09:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:09:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:09:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:09:58,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:09:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:09:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:09:59,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:59,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:09:59,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:09:59,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:09:59,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:09:59,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:09:59,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:09:59,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:09:59,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-07 22:09:59,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:09:59,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:09:59,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:09:59,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:09:59,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:09:59,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:00,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:01,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:01,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:01,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-07 22:10:01,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:01,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 22:10:01,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 22:10:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 22:10:01,080 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-07 22:10:01,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:01,974 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-07 22:10:01,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 22:10:01,975 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-07 22:10:01,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:01,976 INFO L225 Difference]: With dead ends: 115 [2019-01-07 22:10:01,976 INFO L226 Difference]: Without dead ends: 114 [2019-01-07 22:10:01,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 22:10:01,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-07 22:10:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-07 22:10:01,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 22:10:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-07 22:10:01,991 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-07 22:10:01,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:01,992 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-07 22:10:01,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 22:10:01,992 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-07 22:10:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-07 22:10:01,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:01,993 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-07 22:10:01,993 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-07 22:10:01,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:01,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:01,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:01,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:02,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:02,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:02,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:02,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:02,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:02,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:10:02,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:10:02,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:10:02,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:02,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:02,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:02,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:02,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:02,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:03,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-07 22:10:03,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:03,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-07 22:10:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-07 22:10:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 22:10:03,761 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-07 22:10:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:04,687 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-07 22:10:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 22:10:04,688 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-07 22:10:04,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:04,689 INFO L225 Difference]: With dead ends: 120 [2019-01-07 22:10:04,689 INFO L226 Difference]: Without dead ends: 119 [2019-01-07 22:10:04,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 22:10:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-07 22:10:04,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-07 22:10:04,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-07 22:10:04,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-07 22:10:04,709 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-07 22:10:04,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:04,710 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-07 22:10:04,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-07 22:10:04,710 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-07 22:10:04,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-07 22:10:04,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:04,711 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-07 22:10:04,711 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-07 22:10:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:04,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:04,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:05,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:05,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:05,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:05,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:05,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:05,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:05,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:05,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:05,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:05,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:05,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:05,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:05,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:05,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:07,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:07,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-07 22:10:07,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 22:10:07,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 22:10:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 22:10:07,024 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-07 22:10:08,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:08,110 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-07 22:10:08,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 22:10:08,110 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-07 22:10:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:08,112 INFO L225 Difference]: With dead ends: 125 [2019-01-07 22:10:08,112 INFO L226 Difference]: Without dead ends: 124 [2019-01-07 22:10:08,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 22:10:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-07 22:10:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-07 22:10:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-07 22:10:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-07 22:10:08,128 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-07 22:10:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:08,128 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-07 22:10:08,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 22:10:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-07 22:10:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-07 22:10:08,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:08,129 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-07 22:10:08,129 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-07 22:10:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:08,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:08,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:08,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:08,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:08,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:08,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:08,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:10:08,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:10:08,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-07 22:10:08,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:08,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:08,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:08,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:08,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:08,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:09,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:09,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:10,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:10,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-07 22:10:10,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:10,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 22:10:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 22:10:10,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 22:10:10,106 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-07 22:10:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:11,074 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-07 22:10:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-07 22:10:11,075 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-07 22:10:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:11,076 INFO L225 Difference]: With dead ends: 130 [2019-01-07 22:10:11,076 INFO L226 Difference]: Without dead ends: 129 [2019-01-07 22:10:11,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 22:10:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-07 22:10:11,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-07 22:10:11,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-07 22:10:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-07 22:10:11,095 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-07 22:10:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:11,095 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-07 22:10:11,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 22:10:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-07 22:10:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-07 22:10:11,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:11,096 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-07 22:10:11,096 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:11,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:11,096 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-07 22:10:11,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:11,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:11,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:11,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:11,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:11,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:11,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:11,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:11,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:11,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:10:11,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:10:11,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:10:11,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:11,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:11,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:11,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:11,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:11,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:12,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:12,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:13,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-07 22:10:13,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:13,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-07 22:10:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-07 22:10:13,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 22:10:13,395 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-07 22:10:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:14,360 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-07 22:10:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 22:10:14,360 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-07 22:10:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:14,362 INFO L225 Difference]: With dead ends: 135 [2019-01-07 22:10:14,362 INFO L226 Difference]: Without dead ends: 134 [2019-01-07 22:10:14,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 22:10:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-07 22:10:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-07 22:10:14,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-07 22:10:14,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-07 22:10:14,386 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-07 22:10:14,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:14,386 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-07 22:10:14,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-07 22:10:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-07 22:10:14,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-07 22:10:14,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:14,387 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-07 22:10:14,388 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:14,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:14,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-07 22:10:14,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:14,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:14,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:14,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:14,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:15,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:15,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:15,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:15,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:15,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:15,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:15,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:15,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:15,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:15,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:15,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:15,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:15,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:15,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:17,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:17,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-07 22:10:17,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:17,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-07 22:10:17,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-07 22:10:17,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-07 22:10:17,091 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-07 22:10:18,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:18,204 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-07 22:10:18,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 22:10:18,204 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-07 22:10:18,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:18,205 INFO L225 Difference]: With dead ends: 140 [2019-01-07 22:10:18,205 INFO L226 Difference]: Without dead ends: 139 [2019-01-07 22:10:18,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 22:10:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-07 22:10:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-07 22:10:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-07 22:10:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-07 22:10:18,229 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-07 22:10:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:18,229 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-07 22:10:18,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-07 22:10:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-07 22:10:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-07 22:10:18,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:18,230 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-07 22:10:18,230 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-07 22:10:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:18,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:18,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:18,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:18,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:18,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:18,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:18,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:10:18,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:10:18,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-07 22:10:18,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:18,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:18,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:18,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:19,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:19,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:20,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:21,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:21,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-07 22:10:21,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:21,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 22:10:21,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 22:10:21,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 22:10:21,967 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-07 22:10:23,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:23,051 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-07 22:10:23,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 22:10:23,052 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-07 22:10:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:23,052 INFO L225 Difference]: With dead ends: 145 [2019-01-07 22:10:23,053 INFO L226 Difference]: Without dead ends: 144 [2019-01-07 22:10:23,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 22:10:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-07 22:10:23,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-07 22:10:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-07 22:10:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-07 22:10:23,073 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-07 22:10:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:23,074 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-07 22:10:23,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 22:10:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-07 22:10:23,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-07 22:10:23,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:23,075 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-07 22:10:23,075 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-07 22:10:23,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:23,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:23,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:23,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:23,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:23,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:23,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:23,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:23,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:23,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:10:23,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:10:23,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:10:23,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:23,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:23,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:23,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:23,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:24,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:25,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:25,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-07 22:10:25,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:25,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-07 22:10:25,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-07 22:10:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 22:10:25,939 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-07 22:10:27,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:27,328 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-07 22:10:27,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 22:10:27,328 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-07 22:10:27,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:27,329 INFO L225 Difference]: With dead ends: 150 [2019-01-07 22:10:27,329 INFO L226 Difference]: Without dead ends: 149 [2019-01-07 22:10:27,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 22:10:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-07 22:10:27,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-07 22:10:27,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-07 22:10:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-07 22:10:27,352 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-07 22:10:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:27,352 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-07 22:10:27,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-07 22:10:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-07 22:10:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-07 22:10:27,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:27,353 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-07 22:10:27,353 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:27,354 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-07 22:10:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:27,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:27,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:27,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:28,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:28,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:28,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:28,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:28,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:28,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:28,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:28,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:28,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:28,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:28,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:28,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:29,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:30,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:30,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:30,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-07 22:10:30,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:30,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-07 22:10:30,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-07 22:10:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 22:10:30,286 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-07 22:10:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:31,434 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-07 22:10:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 22:10:31,434 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-07 22:10:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:31,435 INFO L225 Difference]: With dead ends: 155 [2019-01-07 22:10:31,435 INFO L226 Difference]: Without dead ends: 154 [2019-01-07 22:10:31,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 22:10:31,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-07 22:10:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-07 22:10:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-07 22:10:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-07 22:10:31,460 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-07 22:10:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:31,461 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-07 22:10:31,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-07 22:10:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-07 22:10:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-07 22:10:31,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:31,461 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-07 22:10:31,462 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:31,462 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-07 22:10:31,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:31,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:31,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:31,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:32,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:32,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:32,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:32,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:32,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:32,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:10:32,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:10:32,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-07 22:10:32,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:32,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:32,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:32,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:32,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:33,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:35,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-07 22:10:35,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:35,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 22:10:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 22:10:35,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 22:10:35,128 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-07 22:10:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:36,384 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-07 22:10:36,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 22:10:36,384 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-07 22:10:36,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:36,385 INFO L225 Difference]: With dead ends: 160 [2019-01-07 22:10:36,385 INFO L226 Difference]: Without dead ends: 159 [2019-01-07 22:10:36,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 22:10:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-07 22:10:36,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-07 22:10:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-07 22:10:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-07 22:10:36,415 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-07 22:10:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:36,416 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-07 22:10:36,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 22:10:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-07 22:10:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-07 22:10:36,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:36,417 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-07 22:10:36,417 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:36,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:36,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-07 22:10:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:36,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:36,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:36,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:37,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:37,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:37,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:37,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:37,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:37,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:37,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:37,899 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:10:37,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:10:38,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:10:38,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:38,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:38,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:38,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:38,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:38,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:38,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:40,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:40,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-07 22:10:40,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:40,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-07 22:10:40,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-07 22:10:40,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 22:10:40,238 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-07 22:10:41,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:41,699 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-07 22:10:41,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 22:10:41,700 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-07 22:10:41,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:41,701 INFO L225 Difference]: With dead ends: 165 [2019-01-07 22:10:41,701 INFO L226 Difference]: Without dead ends: 164 [2019-01-07 22:10:41,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 22:10:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-07 22:10:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-07 22:10:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-07 22:10:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-07 22:10:41,729 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-07 22:10:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:41,730 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-07 22:10:41,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-07 22:10:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-07 22:10:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-07 22:10:41,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:41,731 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-07 22:10:41,731 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:41,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-07 22:10:41,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:41,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:41,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:41,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:42,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:42,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:42,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:42,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:42,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:42,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:42,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:42,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:10:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:42,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:42,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:42,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:42,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:42,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:43,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:45,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:45,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-07 22:10:45,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:45,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-07 22:10:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-07 22:10:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 22:10:45,092 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-07 22:10:45,798 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-07 22:10:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:46,906 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-07 22:10:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 22:10:46,906 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-07 22:10:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:46,908 INFO L225 Difference]: With dead ends: 170 [2019-01-07 22:10:46,908 INFO L226 Difference]: Without dead ends: 169 [2019-01-07 22:10:46,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 22:10:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-07 22:10:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-07 22:10:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-07 22:10:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-07 22:10:46,940 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-07 22:10:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:46,941 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-07 22:10:46,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-07 22:10:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-07 22:10:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-07 22:10:46,942 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:46,942 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-07 22:10:46,942 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:46,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:46,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-07 22:10:46,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:46,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:10:46,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:46,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:48,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:48,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:48,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:48,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:48,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:48,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:48,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:10:48,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:10:48,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-07 22:10:48,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:48,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:48,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:48,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:48,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:48,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:49,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:51,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:51,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-07 22:10:51,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:51,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 22:10:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 22:10:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 22:10:51,673 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-07 22:10:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:53,412 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-07 22:10:53,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 22:10:53,412 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-07 22:10:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:53,413 INFO L225 Difference]: With dead ends: 175 [2019-01-07 22:10:53,414 INFO L226 Difference]: Without dead ends: 174 [2019-01-07 22:10:53,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 22:10:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-07 22:10:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-07 22:10:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-07 22:10:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-07 22:10:53,453 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-07 22:10:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:53,454 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-07 22:10:53,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-07 22:10:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-07 22:10:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-07 22:10:53,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:53,455 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-07 22:10:53,456 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-07 22:10:53,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:53,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:53,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:53,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:10:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:54,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:54,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:10:54,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:10:54,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:10:54,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:10:54,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:10:54,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:10:54,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:10:54,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:10:54,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:10:54,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:10:54,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:10:54,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:10:54,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:10:54,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:10:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:55,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:10:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:10:57,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:10:57,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-07 22:10:57,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:10:57,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-07 22:10:57,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-07 22:10:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-07 22:10:57,246 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-07 22:10:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:10:59,257 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-07 22:10:59,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 22:10:59,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-07 22:10:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:10:59,258 INFO L225 Difference]: With dead ends: 180 [2019-01-07 22:10:59,258 INFO L226 Difference]: Without dead ends: 179 [2019-01-07 22:10:59,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 22:10:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-07 22:10:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-07 22:10:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-07 22:10:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-07 22:10:59,292 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-07 22:10:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:10:59,293 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-07 22:10:59,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-07 22:10:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-07 22:10:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-07 22:10:59,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:10:59,294 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-07 22:10:59,294 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:10:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:10:59,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-07 22:10:59,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:10:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:59,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:10:59,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:10:59,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:10:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:00,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:00,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:00,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:00,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:00,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:00,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:11:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:00,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:00,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:00,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:00,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:00,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:01,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:03,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:03,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-07 22:11:03,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:03,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 22:11:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 22:11:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 22:11:03,468 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-07 22:11:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:05,047 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-07 22:11:05,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 22:11:05,048 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-07 22:11:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:05,049 INFO L225 Difference]: With dead ends: 185 [2019-01-07 22:11:05,049 INFO L226 Difference]: Without dead ends: 184 [2019-01-07 22:11:05,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 22:11:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-07 22:11:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-07 22:11:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-07 22:11:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-07 22:11:05,083 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-07 22:11:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:05,084 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-07 22:11:05,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 22:11:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-07 22:11:05,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-07 22:11:05,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:05,085 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-07 22:11:05,085 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:05,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:05,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-07 22:11:05,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:05,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:05,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:07,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:07,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:07,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:07,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:07,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:07,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:07,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:07,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-07 22:11:07,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:07,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:07,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:07,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:07,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:08,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:10,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:10,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-07 22:11:10,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:10,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-07 22:11:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-07 22:11:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 22:11:10,645 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-07 22:11:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:12,221 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-07 22:11:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 22:11:12,221 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-07 22:11:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:12,222 INFO L225 Difference]: With dead ends: 190 [2019-01-07 22:11:12,223 INFO L226 Difference]: Without dead ends: 189 [2019-01-07 22:11:12,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 22:11:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-07 22:11:12,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-07 22:11:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-07 22:11:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-07 22:11:12,266 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-07 22:11:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:12,267 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-07 22:11:12,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-07 22:11:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-07 22:11:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-07 22:11:12,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:12,268 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-07 22:11:12,268 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:12,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:12,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-07 22:11:12,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:12,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:12,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:12,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:12,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:13,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:13,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:13,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:13,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:13,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:13,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:13,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:13,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:11:13,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:11:13,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:11:13,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:13,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:13,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:13,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:13,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:13,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:15,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:15,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:18,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:18,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:18,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-07 22:11:18,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:18,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-07 22:11:18,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-07 22:11:18,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 22:11:18,226 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-07 22:11:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:20,003 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-07 22:11:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 22:11:20,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-07 22:11:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:20,006 INFO L225 Difference]: With dead ends: 195 [2019-01-07 22:11:20,006 INFO L226 Difference]: Without dead ends: 194 [2019-01-07 22:11:20,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 22:11:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-07 22:11:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-07 22:11:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-07 22:11:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-07 22:11:20,047 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-07 22:11:20,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:20,047 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-07 22:11:20,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-07 22:11:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-07 22:11:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-07 22:11:20,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:20,048 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-07 22:11:20,049 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:20,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-07 22:11:20,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:20,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:20,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:21,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:21,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:21,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:21,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:21,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:21,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:21,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:11:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:21,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:21,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:21,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:21,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:21,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:22,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:24,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:24,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-07 22:11:24,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:24,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 22:11:24,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 22:11:24,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 22:11:24,555 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-07 22:11:25,133 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-07 22:11:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:27,049 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-07 22:11:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-07 22:11:27,050 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-07 22:11:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:27,051 INFO L225 Difference]: With dead ends: 200 [2019-01-07 22:11:27,051 INFO L226 Difference]: Without dead ends: 199 [2019-01-07 22:11:27,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:11:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-07 22:11:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-07 22:11:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-07 22:11:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-07 22:11:27,100 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-07 22:11:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:27,100 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-07 22:11:27,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 22:11:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-07 22:11:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-07 22:11:27,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:27,102 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-07 22:11:27,102 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-07 22:11:27,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:27,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:27,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:27,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:28,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:28,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:28,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:28,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:28,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:28,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:28,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:28,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-07 22:11:28,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:28,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:28,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:28,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:28,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:28,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:29,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:31,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:31,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-07 22:11:31,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:31,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-07 22:11:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-07 22:11:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 22:11:31,672 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-07 22:11:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:33,905 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-07 22:11:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 22:11:33,906 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-07 22:11:33,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:33,907 INFO L225 Difference]: With dead ends: 205 [2019-01-07 22:11:33,907 INFO L226 Difference]: Without dead ends: 204 [2019-01-07 22:11:33,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:11:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-07 22:11:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-07 22:11:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-07 22:11:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-07 22:11:33,943 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-07 22:11:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:33,943 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-07 22:11:33,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-07 22:11:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-07 22:11:33,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-07 22:11:33,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:33,977 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-07 22:11:33,977 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:33,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:33,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-07 22:11:33,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:33,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:33,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:33,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:33,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:35,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:35,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:35,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:35,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:35,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:35,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:11:35,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:11:35,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:11:35,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:35,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:35,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:35,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:35,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:35,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:36,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:38,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:38,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-07 22:11:38,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:38,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-07 22:11:38,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-07 22:11:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-07 22:11:38,973 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-07 22:11:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:40,920 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-07 22:11:40,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 22:11:40,921 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-07 22:11:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:40,922 INFO L225 Difference]: With dead ends: 210 [2019-01-07 22:11:40,922 INFO L226 Difference]: Without dead ends: 209 [2019-01-07 22:11:40,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:11:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-07 22:11:40,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-07 22:11:40,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-07 22:11:40,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-07 22:11:40,960 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-07 22:11:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:40,960 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-07 22:11:40,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-07 22:11:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-07 22:11:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-07 22:11:40,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:40,961 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-07 22:11:40,962 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:40,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-07 22:11:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:40,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:40,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:40,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:42,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:42,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:42,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:42,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:42,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:42,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:42,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:42,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:11:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:42,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:42,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:42,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:42,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:42,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:43,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:46,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:46,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-07 22:11:46,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:46,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 22:11:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 22:11:46,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 22:11:46,013 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-07 22:11:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:48,041 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-07 22:11:48,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 22:11:48,042 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-07 22:11:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:48,043 INFO L225 Difference]: With dead ends: 215 [2019-01-07 22:11:48,043 INFO L226 Difference]: Without dead ends: 214 [2019-01-07 22:11:48,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:11:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-07 22:11:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-07 22:11:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-07 22:11:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-07 22:11:48,094 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-07 22:11:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:48,094 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-07 22:11:48,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 22:11:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-07 22:11:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-07 22:11:48,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:48,095 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-07 22:11:48,096 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:48,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:48,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-07 22:11:48,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:48,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:11:48,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:48,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:49,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:49,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:49,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:49,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:49,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:49,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:49,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:49,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:11:49,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:11:50,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-07 22:11:50,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:50,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:50,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:50,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:50,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:50,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:51,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:11:54,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:54,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:11:54,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-07 22:11:54,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:11:54,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-07 22:11:54,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-07 22:11:54,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-07 22:11:54,147 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-07 22:11:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:11:56,281 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-07 22:11:56,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-07 22:11:56,281 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-07 22:11:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:11:56,282 INFO L225 Difference]: With dead ends: 220 [2019-01-07 22:11:56,282 INFO L226 Difference]: Without dead ends: 219 [2019-01-07 22:11:56,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 22:11:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-07 22:11:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-07 22:11:56,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-07 22:11:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-07 22:11:56,323 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-07 22:11:56,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:11:56,324 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-07 22:11:56,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-07 22:11:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-07 22:11:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-07 22:11:56,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:11:56,325 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-07 22:11:56,325 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:11:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:11:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-07 22:11:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:11:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:56,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:11:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:11:56,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:11:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:11:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:57,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:57,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:11:57,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:11:57,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:11:57,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:11:57,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:11:57,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:11:57,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:11:57,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:11:57,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:11:57,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:11:57,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:11:57,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:11:57,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:11:57,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:11:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:11:59,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:01,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:01,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-07 22:12:01,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:01,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-07 22:12:01,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-07 22:12:01,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 22:12:01,833 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-07 22:12:04,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:04,251 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-07 22:12:04,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 22:12:04,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-07 22:12:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:04,253 INFO L225 Difference]: With dead ends: 225 [2019-01-07 22:12:04,253 INFO L226 Difference]: Without dead ends: 224 [2019-01-07 22:12:04,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 22:12:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-07 22:12:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-07 22:12:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-07 22:12:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-07 22:12:04,296 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-07 22:12:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:04,297 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-07 22:12:04,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-07 22:12:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-07 22:12:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-07 22:12:04,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:04,298 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-07 22:12:04,298 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:04,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:04,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-07 22:12:04,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:04,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:04,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:05,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:05,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:05,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:05,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:05,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:05,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:05,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:12:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:05,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:05,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:05,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:05,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:05,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:06,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:09,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:09,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-07 22:12:09,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:09,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 22:12:09,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 22:12:09,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-07 22:12:09,967 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-07 22:12:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:12,324 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-07 22:12:12,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 22:12:12,325 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-07 22:12:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:12,326 INFO L225 Difference]: With dead ends: 230 [2019-01-07 22:12:12,326 INFO L226 Difference]: Without dead ends: 229 [2019-01-07 22:12:12,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:12:12,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-07 22:12:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-07 22:12:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-07 22:12:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-07 22:12:12,380 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-07 22:12:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:12,381 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-07 22:12:12,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 22:12:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-07 22:12:12,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-07 22:12:12,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:12,382 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-07 22:12:12,382 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:12,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:12,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-07 22:12:12,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:12,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:12,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:13,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:13,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:13,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:13,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:13,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:13,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:13,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:12:13,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:12:13,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-07 22:12:13,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:13,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:13,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:13,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:13,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:13,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:15,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:18,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:18,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:18,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-07 22:12:18,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:18,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-07 22:12:18,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-07 22:12:18,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 22:12:18,688 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-07 22:12:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:21,265 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-07 22:12:21,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-07 22:12:21,266 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-07 22:12:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:21,267 INFO L225 Difference]: With dead ends: 235 [2019-01-07 22:12:21,267 INFO L226 Difference]: Without dead ends: 234 [2019-01-07 22:12:21,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:12:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-07 22:12:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-07 22:12:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-07 22:12:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-07 22:12:21,332 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-07 22:12:21,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:21,333 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-07 22:12:21,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-07 22:12:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-07 22:12:21,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-07 22:12:21,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:21,334 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-07 22:12:21,334 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:21,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-07 22:12:21,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:21,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:21,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:22,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:22,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:22,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:22,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:22,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:22,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:12:22,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:12:23,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:12:23,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:23,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:23,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:23,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:23,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:23,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:24,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:27,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:27,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-07 22:12:27,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:27,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-07 22:12:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-07 22:12:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-07 22:12:27,546 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-07 22:12:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:30,187 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-07 22:12:30,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 22:12:30,188 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-07 22:12:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:30,189 INFO L225 Difference]: With dead ends: 240 [2019-01-07 22:12:30,189 INFO L226 Difference]: Without dead ends: 239 [2019-01-07 22:12:30,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 22:12:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-07 22:12:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-07 22:12:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-07 22:12:30,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-07 22:12:30,258 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-07 22:12:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:30,259 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-07 22:12:30,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-07 22:12:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-07 22:12:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-07 22:12:30,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:30,260 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-07 22:12:30,261 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:30,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-07 22:12:30,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:30,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:30,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:31,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:31,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:31,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:31,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:31,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:31,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:31,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:31,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:12:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:31,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:31,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:31,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:31,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:31,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:33,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:36,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:36,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-07 22:12:36,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:36,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-07 22:12:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-07 22:12:36,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 22:12:36,769 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-07 22:12:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:39,389 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-07 22:12:39,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-07 22:12:39,393 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-07 22:12:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:39,394 INFO L225 Difference]: With dead ends: 245 [2019-01-07 22:12:39,394 INFO L226 Difference]: Without dead ends: 244 [2019-01-07 22:12:39,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 22:12:39,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-07 22:12:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-07 22:12:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-07 22:12:39,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-07 22:12:39,457 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-07 22:12:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:39,457 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-07 22:12:39,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-07 22:12:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-07 22:12:39,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-07 22:12:39,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:39,458 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-07 22:12:39,458 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-07 22:12:39,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:39,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:12:39,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:39,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:41,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:41,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:41,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:41,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:41,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:41,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:12:41,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:12:41,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-07 22:12:41,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:41,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:41,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:41,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:41,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:41,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:43,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:46,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-07 22:12:46,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-07 22:12:46,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-07 22:12:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-07 22:12:46,571 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-07 22:12:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:49,260 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-07 22:12:49,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 22:12:49,261 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-07 22:12:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:49,262 INFO L225 Difference]: With dead ends: 250 [2019-01-07 22:12:49,262 INFO L226 Difference]: Without dead ends: 249 [2019-01-07 22:12:49,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 22:12:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-07 22:12:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-07 22:12:49,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-07 22:12:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-07 22:12:49,324 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-07 22:12:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:49,324 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-07 22:12:49,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-07 22:12:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-07 22:12:49,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-07 22:12:49,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:49,325 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-07 22:12:49,326 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:49,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:49,326 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-07 22:12:49,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:49,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:49,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:49,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:49,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:12:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:51,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:51,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:12:51,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:12:51,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:12:51,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:12:51,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:12:51,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:12:51,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:12:51,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:12:51,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:12:51,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:12:51,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:12:51,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:12:51,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:12:51,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:12:52,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:52,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:12:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:12:56,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:12:56,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-07 22:12:56,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:12:56,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-07 22:12:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-07 22:12:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 22:12:56,264 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-07 22:12:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:12:59,031 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-07 22:12:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-07 22:12:59,031 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-07 22:12:59,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:12:59,033 INFO L225 Difference]: With dead ends: 255 [2019-01-07 22:12:59,033 INFO L226 Difference]: Without dead ends: 254 [2019-01-07 22:12:59,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 22:12:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-07 22:12:59,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-07 22:12:59,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-07 22:12:59,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-07 22:12:59,096 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-07 22:12:59,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:12:59,096 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-07 22:12:59,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-07 22:12:59,097 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-07 22:12:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-07 22:12:59,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:12:59,098 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-07 22:12:59,098 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:12:59,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:12:59,099 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-07 22:12:59,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:12:59,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:59,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:12:59,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:12:59,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:12:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:00,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:00,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:00,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:00,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:00,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:00,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:00,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:13:00,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:13:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:01,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:01,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:01,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:01,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:01,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:02,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:06,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:06,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-07 22:13:06,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:06,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-07 22:13:06,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-07 22:13:06,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-07 22:13:06,540 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-07 22:13:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:13:09,293 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-07 22:13:09,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 22:13:09,293 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-07 22:13:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:13:09,295 INFO L225 Difference]: With dead ends: 260 [2019-01-07 22:13:09,295 INFO L226 Difference]: Without dead ends: 259 [2019-01-07 22:13:09,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 22:13:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-07 22:13:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-07 22:13:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-07 22:13:09,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-07 22:13:09,358 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-07 22:13:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:13:09,358 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-07 22:13:09,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-07 22:13:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-07 22:13:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-07 22:13:09,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:13:09,360 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-07 22:13:09,360 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:13:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:13:09,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-07 22:13:09,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:13:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:09,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:13:09,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:09,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:13:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:11,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:11,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:11,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:11,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:11,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:11,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:11,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:13:11,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:13:11,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-07 22:13:11,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:13:11,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:11,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:11,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:11,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:11,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:13,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:17,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:17,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-07 22:13:17,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:17,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-07 22:13:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-07 22:13:17,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 22:13:17,103 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-07 22:13:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:13:19,953 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-07 22:13:19,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 22:13:19,954 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-07 22:13:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:13:19,955 INFO L225 Difference]: With dead ends: 265 [2019-01-07 22:13:19,955 INFO L226 Difference]: Without dead ends: 264 [2019-01-07 22:13:19,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 22:13:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-07 22:13:20,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-07 22:13:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-07 22:13:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-07 22:13:20,012 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-07 22:13:20,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:13:20,012 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-07 22:13:20,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-07 22:13:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-07 22:13:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-07 22:13:20,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:13:20,014 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-07 22:13:20,014 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:13:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:13:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-07 22:13:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:13:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:20,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:13:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:20,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:13:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:21,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:21,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:21,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:21,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:21,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:21,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:21,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:13:21,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:13:21,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:13:21,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:13:21,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:21,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:21,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:21,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:21,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:23,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:27,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:27,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-07 22:13:27,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:27,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-07 22:13:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-07 22:13:27,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-07 22:13:27,555 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-07 22:13:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:13:30,496 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-07 22:13:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 22:13:30,496 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-07 22:13:30,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:13:30,497 INFO L225 Difference]: With dead ends: 270 [2019-01-07 22:13:30,497 INFO L226 Difference]: Without dead ends: 269 [2019-01-07 22:13:30,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-07 22:13:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-07 22:13:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-07 22:13:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-07 22:13:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-07 22:13:30,569 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-07 22:13:30,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:13:30,569 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-07 22:13:30,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-07 22:13:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-07 22:13:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-07 22:13:30,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:13:30,611 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-07 22:13:30,611 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:13:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:13:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-07 22:13:30,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:13:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:30,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:13:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:30,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:13:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:32,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:32,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:32,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:32,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:32,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:32,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:13:32,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:13:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:32,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:32,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:32,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:32,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:32,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:34,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:38,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:38,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-07 22:13:38,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-07 22:13:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-07 22:13:38,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:13:38,203 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-07 22:13:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:13:41,151 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-07 22:13:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-07 22:13:41,152 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-07 22:13:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:13:41,153 INFO L225 Difference]: With dead ends: 275 [2019-01-07 22:13:41,153 INFO L226 Difference]: Without dead ends: 274 [2019-01-07 22:13:41,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-07 22:13:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-07 22:13:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-07 22:13:41,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-07 22:13:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-07 22:13:41,222 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-07 22:13:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:13:41,222 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-07 22:13:41,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-07 22:13:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-07 22:13:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-07 22:13:41,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:13:41,224 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-07 22:13:41,224 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:13:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:13:41,224 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-07 22:13:41,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:13:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:41,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:13:41,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:41,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:13:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:42,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:42,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:42,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:42,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:42,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:42,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:13:42,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:13:43,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-07 22:13:43,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:13:43,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:43,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:43,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:43,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:43,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:45,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:48,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:48,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-07 22:13:48,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:48,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-07 22:13:48,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-07 22:13:48,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-07 22:13:48,606 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-07 22:13:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:13:51,639 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-07 22:13:51,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 22:13:51,639 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-07 22:13:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:13:51,640 INFO L225 Difference]: With dead ends: 280 [2019-01-07 22:13:51,640 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 22:13:51,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-07 22:13:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 22:13:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-07 22:13:51,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-07 22:13:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-07 22:13:51,712 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-07 22:13:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:13:51,712 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-07 22:13:51,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-07 22:13:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-07 22:13:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-07 22:13:51,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:13:51,714 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-07 22:13:51,714 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:13:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:13:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-07 22:13:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:13:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:51,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:13:51,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:13:51,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:13:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:13:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:53,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:53,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:13:53,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:13:53,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:13:53,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:13:53,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:13:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:13:53,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:13:53,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:13:53,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:13:53,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:13:53,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:13:53,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:13:53,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:13:53,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:13:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:55,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:13:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:13:59,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:13:59,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-07 22:13:59,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:13:59,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-07 22:13:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-07 22:13:59,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 22:13:59,050 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-07 22:14:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:02,239 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-07 22:14:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 22:14:02,239 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-07 22:14:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:02,240 INFO L225 Difference]: With dead ends: 285 [2019-01-07 22:14:02,241 INFO L226 Difference]: Without dead ends: 284 [2019-01-07 22:14:02,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-07 22:14:02,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-07 22:14:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-07 22:14:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-07 22:14:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-07 22:14:02,307 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-07 22:14:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:02,307 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-07 22:14:02,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-07 22:14:02,307 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-07 22:14:02,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-07 22:14:02,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:02,308 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-07 22:14:02,309 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:02,309 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-07 22:14:02,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:02,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:14:02,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:02,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:03,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:14:03,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:14:03,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:14:03,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:03,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:14:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:14:03,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:14:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:04,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:14:04,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:14:04,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:14:04,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:14:04,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:14:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:06,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:14:09,744 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:14:09,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-07 22:14:09,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:14:09,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-07 22:14:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-07 22:14:09,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-07 22:14:09,788 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-07 22:14:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:13,015 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-07 22:14:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 22:14:13,015 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-07 22:14:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:13,016 INFO L225 Difference]: With dead ends: 290 [2019-01-07 22:14:13,016 INFO L226 Difference]: Without dead ends: 289 [2019-01-07 22:14:13,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-07 22:14:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-07 22:14:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-07 22:14:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-07 22:14:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-07 22:14:13,084 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-07 22:14:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-07 22:14:13,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-07 22:14:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-07 22:14:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-07 22:14:13,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:13,085 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-07 22:14:13,085 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-07 22:14:13,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:13,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:14:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:13,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:14,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:14,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:14:14,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:14:14,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:14:14,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:14,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:14:14,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:14:14,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:14:15,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-07 22:14:15,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:14:15,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:14:15,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:14:15,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:14:15,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:14:15,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:14:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:17,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:14:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:21,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:14:21,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-07 22:14:21,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:14:21,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-07 22:14:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-07 22:14:21,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:14:21,029 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-07 22:14:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:24,434 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-07 22:14:24,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-07 22:14:24,434 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-07 22:14:24,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:24,435 INFO L225 Difference]: With dead ends: 295 [2019-01-07 22:14:24,435 INFO L226 Difference]: Without dead ends: 294 [2019-01-07 22:14:24,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-07 22:14:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-07 22:14:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-07 22:14:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-07 22:14:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-07 22:14:24,504 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-07 22:14:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:24,505 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-07 22:14:24,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-07 22:14:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-07 22:14:24,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-07 22:14:24,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:24,506 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-07 22:14:24,506 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:24,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:24,507 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-07 22:14:24,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:24,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:14:24,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:24,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:26,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:14:26,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:14:26,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:14:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:26,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:14:26,207 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:14:26,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:14:26,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:14:26,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:14:26,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:14:26,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:14:26,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:14:26,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:14:26,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:14:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:28,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:14:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:32,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:14:32,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-07 22:14:32,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:14:32,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-07 22:14:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-07 22:14:32,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-07 22:14:32,339 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-07 22:14:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:35,709 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-07 22:14:35,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 22:14:35,709 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-07 22:14:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:35,710 INFO L225 Difference]: With dead ends: 300 [2019-01-07 22:14:35,710 INFO L226 Difference]: Without dead ends: 299 [2019-01-07 22:14:35,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-07 22:14:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-07 22:14:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-07 22:14:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-07 22:14:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-07 22:14:35,789 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-07 22:14:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:35,789 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-07 22:14:35,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-07 22:14:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-07 22:14:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-07 22:14:35,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:35,791 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-07 22:14:35,791 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:35,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-07 22:14:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:35,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:14:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:35,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:37,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:37,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:14:37,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:14:37,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:14:37,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:37,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:14:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:14:37,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:14:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:37,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:14:37,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:14:37,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:14:37,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:14:37,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:14:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:40,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:14:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:43,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:14:43,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-07 22:14:43,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:14:43,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-07 22:14:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-07 22:14:43,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 22:14:43,936 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-07 22:14:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:47,358 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-07 22:14:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 22:14:47,358 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-07 22:14:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:47,359 INFO L225 Difference]: With dead ends: 305 [2019-01-07 22:14:47,360 INFO L226 Difference]: Without dead ends: 304 [2019-01-07 22:14:47,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-07 22:14:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-07 22:14:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-07 22:14:47,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-07 22:14:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-07 22:14:47,437 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-07 22:14:47,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:47,437 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-07 22:14:47,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-07 22:14:47,437 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-07 22:14:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-07 22:14:47,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:47,438 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-07 22:14:47,439 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:47,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-07 22:14:47,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:14:47,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:47,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:14:49,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:49,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:49,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:14:49,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:14:49,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:14:49,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:14:49,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:14:49,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:14:49,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:14:49,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-07 22:14:49,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:14:49,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:14:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:14:49,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:14:49,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:14:49,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:14:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:52,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:14:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:14:55,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:14:55,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-07 22:14:55,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:14:55,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-07 22:14:55,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-07 22:14:55,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-07 22:14:55,851 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-07 22:14:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:14:59,481 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-07 22:14:59,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 22:14:59,481 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-07 22:14:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:14:59,482 INFO L225 Difference]: With dead ends: 310 [2019-01-07 22:14:59,482 INFO L226 Difference]: Without dead ends: 309 [2019-01-07 22:14:59,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-07 22:14:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-07 22:14:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-07 22:14:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-07 22:14:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-07 22:14:59,560 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-07 22:14:59,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:14:59,561 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-07 22:14:59,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-07 22:14:59,561 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-07 22:14:59,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-07 22:14:59,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:14:59,562 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-07 22:14:59,562 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:14:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:14:59,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-07 22:14:59,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:14:59,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:59,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:14:59,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:14:59,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:14:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:01,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:01,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:15:01,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:15:01,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:15:01,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:01,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:15:01,500 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:15:01,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:15:01,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:15:01,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:15:01,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:15:01,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:15:01,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:15:01,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:15:01,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:15:03,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:03,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:15:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:07,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:15:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-07 22:15:07,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:15:07,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-07 22:15:07,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-07 22:15:07,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:15:07,703 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-07 22:15:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:15:11,322 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-07 22:15:11,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-07 22:15:11,322 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-07 22:15:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:15:11,323 INFO L225 Difference]: With dead ends: 315 [2019-01-07 22:15:11,323 INFO L226 Difference]: Without dead ends: 314 [2019-01-07 22:15:11,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-07 22:15:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-07 22:15:11,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-07 22:15:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-07 22:15:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-07 22:15:11,411 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-07 22:15:11,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:15:11,411 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-07 22:15:11,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-07 22:15:11,411 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-07 22:15:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-07 22:15:11,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:15:11,413 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-07 22:15:11,413 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:15:11,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:15:11,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-07 22:15:11,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:15:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:11,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:15:11,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:11,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:15:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:13,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:13,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:13,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:15:13,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:15:13,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:15:13,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:13,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:15:13,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:15:13,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:15:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:13,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:15:13,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:15:13,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:15:13,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:15:13,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:15:15,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:15,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:15:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:19,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:15:19,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-07 22:15:19,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:15:19,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-07 22:15:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-07 22:15:19,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-07 22:15:19,831 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-07 22:15:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:15:23,612 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-07 22:15:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-07 22:15:23,612 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-07 22:15:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:15:23,613 INFO L225 Difference]: With dead ends: 320 [2019-01-07 22:15:23,613 INFO L226 Difference]: Without dead ends: 319 [2019-01-07 22:15:23,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-07 22:15:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-07 22:15:23,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-07 22:15:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-07 22:15:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-07 22:15:23,697 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-07 22:15:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:15:23,697 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-07 22:15:23,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-07 22:15:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-07 22:15:23,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-07 22:15:23,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:15:23,699 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-07 22:15:23,699 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:15:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:15:23,699 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-07 22:15:23,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:15:23,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:23,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:15:23,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:23,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:15:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:25,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:15:25,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:15:25,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:15:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:25,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:15:25,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:15:25,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:15:26,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-07 22:15:26,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:15:26,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:15:26,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:15:26,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:15:26,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:15:26,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:15:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:28,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:15:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:32,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:15:32,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-07 22:15:32,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:15:32,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-07 22:15:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-07 22:15:32,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 22:15:32,463 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-07 22:15:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:15:36,134 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-07 22:15:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 22:15:36,134 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-07 22:15:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:15:36,135 INFO L225 Difference]: With dead ends: 325 [2019-01-07 22:15:36,135 INFO L226 Difference]: Without dead ends: 324 [2019-01-07 22:15:36,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-07 22:15:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-07 22:15:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-07 22:15:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-07 22:15:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-07 22:15:36,213 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-07 22:15:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:15:36,214 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-07 22:15:36,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-07 22:15:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-07 22:15:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-07 22:15:36,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:15:36,215 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-07 22:15:36,215 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:15:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:15:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-07 22:15:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:15:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:36,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:15:36,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:15:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:38,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:38,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:15:38,228 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:15:38,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:15:38,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:38,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:15:38,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:15:38,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:15:38,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:15:38,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:15:38,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:15:38,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:15:38,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:15:38,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:15:38,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:15:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:40,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:15:44,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:44,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:15:44,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-07 22:15:44,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:15:44,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-07 22:15:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-07 22:15:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-07 22:15:44,844 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-07 22:15:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:15:48,782 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-07 22:15:48,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 22:15:48,782 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-07 22:15:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:15:48,784 INFO L225 Difference]: With dead ends: 330 [2019-01-07 22:15:48,784 INFO L226 Difference]: Without dead ends: 329 [2019-01-07 22:15:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-07 22:15:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-07 22:15:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-07 22:15:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-07 22:15:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-07 22:15:48,865 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-07 22:15:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:15:48,865 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-07 22:15:48,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-07 22:15:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-07 22:15:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-07 22:15:48,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:15:48,866 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-07 22:15:48,867 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:15:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:15:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-07 22:15:48,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:15:48,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:48,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:15:48,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:15:48,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:15:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:51,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:51,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:51,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:15:51,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:15:51,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:15:51,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:15:51,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:15:51,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:15:51,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:15:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:15:51,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:15:51,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:15:51,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:15:51,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:15:51,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:15:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:53,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:15:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:15:57,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:15:57,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-07 22:15:57,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:15:57,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-07 22:15:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-07 22:15:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:15:57,708 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-07 22:16:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:16:01,731 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-07 22:16:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-07 22:16:01,732 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-07 22:16:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:16:01,733 INFO L225 Difference]: With dead ends: 335 [2019-01-07 22:16:01,733 INFO L226 Difference]: Without dead ends: 334 [2019-01-07 22:16:01,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-07 22:16:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-07 22:16:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-07 22:16:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-07 22:16:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-07 22:16:01,823 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-07 22:16:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:16:01,823 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-07 22:16:01,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-07 22:16:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-07 22:16:01,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-07 22:16:01,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:16:01,825 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-07 22:16:01,825 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:16:01,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:16:01,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-07 22:16:01,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:16:01,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:01,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:16:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:01,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:16:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:04,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:16:04,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:16:04,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:16:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:04,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:16:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:16:04,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:16:04,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-07 22:16:04,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:16:04,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:16:04,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:16:04,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:16:04,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:16:04,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:16:07,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:07,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:16:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:11,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:16:11,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-07 22:16:11,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:16:11,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-07 22:16:11,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-07 22:16:11,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-07 22:16:11,180 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-07 22:16:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:16:15,272 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-07 22:16:15,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-07 22:16:15,272 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-07 22:16:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:16:15,274 INFO L225 Difference]: With dead ends: 340 [2019-01-07 22:16:15,274 INFO L226 Difference]: Without dead ends: 339 [2019-01-07 22:16:15,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-07 22:16:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-07 22:16:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-07 22:16:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-07 22:16:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-07 22:16:15,398 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-07 22:16:15,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:16:15,398 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-07 22:16:15,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-07 22:16:15,399 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-07 22:16:15,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-07 22:16:15,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:16:15,400 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-07 22:16:15,400 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:16:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:16:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-07 22:16:15,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:16:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:15,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:16:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:15,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:16:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:17,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:17,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:16:17,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:16:17,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:16:17,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:17,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:16:17,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:16:17,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:16:17,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:16:17,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:16:17,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:16:17,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:16:17,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:16:17,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:16:17,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:16:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:20,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:16:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:24,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:16:24,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-07 22:16:24,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:16:24,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-07 22:16:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-07 22:16:24,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 22:16:24,547 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-07 22:16:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:16:28,781 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-07 22:16:28,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-07 22:16:28,781 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-07 22:16:28,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:16:28,782 INFO L225 Difference]: With dead ends: 345 [2019-01-07 22:16:28,782 INFO L226 Difference]: Without dead ends: 344 [2019-01-07 22:16:28,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-07 22:16:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-07 22:16:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-07 22:16:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-07 22:16:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-07 22:16:28,891 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-07 22:16:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:16:28,892 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-07 22:16:28,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-07 22:16:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-07 22:16:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-07 22:16:28,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:16:28,893 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-07 22:16:28,893 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:16:28,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:16:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-07 22:16:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:16:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:28,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:16:28,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:28,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:16:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:31,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:31,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:31,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:16:31,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:16:31,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:16:31,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:31,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:16:31,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:16:31,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:16:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:31,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:16:31,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:16:31,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:16:31,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:16:31,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:16:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:34,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:16:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:38,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:16:38,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-07 22:16:38,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:16:38,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-07 22:16:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-07 22:16:38,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-07 22:16:38,175 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-07 22:16:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:16:42,505 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-07 22:16:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 22:16:42,505 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-07 22:16:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:16:42,506 INFO L225 Difference]: With dead ends: 350 [2019-01-07 22:16:42,506 INFO L226 Difference]: Without dead ends: 349 [2019-01-07 22:16:42,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-07 22:16:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-07 22:16:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-07 22:16:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-07 22:16:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-07 22:16:42,605 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-07 22:16:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:16:42,605 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-07 22:16:42,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-07 22:16:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-07 22:16:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-07 22:16:42,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:16:42,607 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-07 22:16:42,607 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:16:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:16:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-07 22:16:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:16:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:42,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:16:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:42,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:16:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:44,957 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:44,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:44,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:16:44,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:16:44,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:16:44,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:44,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:16:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:16:44,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:16:45,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-07 22:16:45,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:16:45,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:16:45,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:16:45,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:16:45,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:16:45,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:16:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:48,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:16:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:52,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:16:52,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-07 22:16:52,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:16:52,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-07 22:16:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-07 22:16:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 22:16:52,331 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-07 22:16:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:16:56,726 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-07 22:16:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-07 22:16:56,727 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-07 22:16:56,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:16:56,728 INFO L225 Difference]: With dead ends: 355 [2019-01-07 22:16:56,728 INFO L226 Difference]: Without dead ends: 354 [2019-01-07 22:16:56,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-07 22:16:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-07 22:16:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-07 22:16:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-07 22:16:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-07 22:16:56,832 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-07 22:16:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:16:56,832 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-07 22:16:56,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-07 22:16:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-07 22:16:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-07 22:16:56,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:16:56,833 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-07 22:16:56,834 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:16:56,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:16:56,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-07 22:16:56,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:16:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:56,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:16:56,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:16:56,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:16:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:16:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:16:59,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:59,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:16:59,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:16:59,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:16:59,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:16:59,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:16:59,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:16:59,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:16:59,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:16:59,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:16:59,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:16:59,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:16:59,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:16:59,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:16:59,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:17:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:02,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:17:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:06,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:17:06,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-07 22:17:06,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:17:06,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-07 22:17:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-07 22:17:06,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-07 22:17:06,678 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-07 22:17:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:17:11,238 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-07 22:17:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-07 22:17:11,238 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-07 22:17:11,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:17:11,239 INFO L225 Difference]: With dead ends: 360 [2019-01-07 22:17:11,240 INFO L226 Difference]: Without dead ends: 359 [2019-01-07 22:17:11,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-07 22:17:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-07 22:17:11,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-07 22:17:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-07 22:17:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-07 22:17:11,346 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-07 22:17:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:17:11,346 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-07 22:17:11,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-07 22:17:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-07 22:17:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-07 22:17:11,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:17:11,348 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-07 22:17:11,348 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:17:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:17:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-07 22:17:11,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:17:11,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:11,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:17:11,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:11,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:17:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:13,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:13,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:17:13,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:17:13,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:17:13,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:13,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:17:13,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:17:13,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:17:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:14,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:17:14,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:17:14,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:17:14,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:17:14,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:17:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:17,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:17:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:21,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:17:21,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-07 22:17:21,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:17:21,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-07 22:17:21,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-07 22:17:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 22:17:21,211 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-07 22:17:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:17:25,842 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-07 22:17:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 22:17:25,843 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-07 22:17:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:17:25,844 INFO L225 Difference]: With dead ends: 365 [2019-01-07 22:17:25,844 INFO L226 Difference]: Without dead ends: 364 [2019-01-07 22:17:25,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-07 22:17:25,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-07 22:17:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-07 22:17:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-07 22:17:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-07 22:17:25,944 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-07 22:17:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:17:25,944 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-07 22:17:25,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-07 22:17:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-07 22:17:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-07 22:17:25,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:17:25,945 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-07 22:17:25,946 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:17:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:17:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-07 22:17:25,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:17:25,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:25,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:17:25,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:25,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:17:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:28,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:28,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:17:28,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:17:28,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:17:28,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:28,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:17:28,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:17:28,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:17:29,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-07 22:17:29,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:17:29,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:17:29,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:17:29,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:17:29,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:17:29,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:17:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:32,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:17:36,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:36,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:17:36,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-07 22:17:36,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:17:36,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-07 22:17:36,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-07 22:17:36,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-07 22:17:36,312 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-07 22:17:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:17:41,023 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-07 22:17:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 22:17:41,024 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-07 22:17:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:17:41,025 INFO L225 Difference]: With dead ends: 370 [2019-01-07 22:17:41,025 INFO L226 Difference]: Without dead ends: 369 [2019-01-07 22:17:41,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-07 22:17:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-07 22:17:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-07 22:17:41,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-07 22:17:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-07 22:17:41,137 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-07 22:17:41,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:17:41,138 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-07 22:17:41,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-07 22:17:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-07 22:17:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-07 22:17:41,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:17:41,139 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-07 22:17:41,139 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:17:41,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:17:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-07 22:17:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:17:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:41,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:17:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:41,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:17:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:43,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:43,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:17:43,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:17:43,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:17:43,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:43,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:17:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:17:43,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:17:44,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:17:44,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:17:44,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:17:44,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:17:44,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:17:44,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:17:44,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:17:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:47,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:17:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:51,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:17:51,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-07 22:17:51,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:17:51,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-07 22:17:51,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-07 22:17:51,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 22:17:51,343 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-07 22:17:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:17:56,134 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-07 22:17:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-07 22:17:56,134 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-07 22:17:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:17:56,136 INFO L225 Difference]: With dead ends: 375 [2019-01-07 22:17:56,136 INFO L226 Difference]: Without dead ends: 374 [2019-01-07 22:17:56,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-07 22:17:56,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-07 22:17:56,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-07 22:17:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-07 22:17:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-07 22:17:56,278 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-07 22:17:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:17:56,278 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-07 22:17:56,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-07 22:17:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-07 22:17:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-07 22:17:56,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:17:56,280 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-07 22:17:56,280 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:17:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:17:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-07 22:17:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:17:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:56,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:17:56,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:17:56,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:17:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:17:58,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:58,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:17:58,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:17:58,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:17:58,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:17:58,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:17:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:17:58,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:17:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:17:59,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:17:59,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:17:59,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:17:59,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:17:59,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:18:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:02,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:18:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:06,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:18:06,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-07 22:18:06,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:18:06,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-07 22:18:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-07 22:18:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-07 22:18:06,625 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-07 22:18:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:18:11,662 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-07 22:18:11,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-07 22:18:11,662 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-07 22:18:11,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:18:11,663 INFO L225 Difference]: With dead ends: 380 [2019-01-07 22:18:11,663 INFO L226 Difference]: Without dead ends: 379 [2019-01-07 22:18:11,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-07 22:18:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-07 22:18:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-07 22:18:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-07 22:18:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-07 22:18:11,782 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-07 22:18:11,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:18:11,783 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-07 22:18:11,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-07 22:18:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-07 22:18:11,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-07 22:18:11,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:18:11,784 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-07 22:18:11,784 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:18:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:18:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-07 22:18:11,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:18:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:11,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:18:11,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:11,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:18:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:18:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:14,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:14,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:18:14,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:18:14,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:18:14,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:14,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:18:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:18:14,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:18:15,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-07 22:18:15,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:18:15,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:18:15,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:18:15,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:18:15,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:18:15,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:18:18,542 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:18,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:18:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:22,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:18:22,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-07 22:18:22,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:18:22,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-07 22:18:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-07 22:18:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 22:18:22,666 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-07 22:18:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:18:27,638 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-07 22:18:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-07 22:18:27,638 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-07 22:18:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:18:27,639 INFO L225 Difference]: With dead ends: 385 [2019-01-07 22:18:27,640 INFO L226 Difference]: Without dead ends: 384 [2019-01-07 22:18:27,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-07 22:18:27,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-07 22:18:27,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-07 22:18:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-07 22:18:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-07 22:18:27,752 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-07 22:18:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:18:27,752 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-07 22:18:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-07 22:18:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-07 22:18:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-07 22:18:27,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:18:27,754 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-07 22:18:27,754 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:18:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:18:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-07 22:18:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:18:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:27,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:18:27,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:27,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:18:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:18:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:30,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:30,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:18:30,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:18:30,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:18:30,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:30,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:18:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:18:30,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:18:30,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:18:30,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:18:30,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:18:30,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:18:30,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:18:30,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:18:30,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:18:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:34,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:18:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:38,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:18:38,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-07 22:18:38,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:18:38,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-07 22:18:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-07 22:18:38,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-07 22:18:38,371 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-07 22:18:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:18:43,571 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-07 22:18:43,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 22:18:43,571 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-07 22:18:43,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:18:43,572 INFO L225 Difference]: With dead ends: 390 [2019-01-07 22:18:43,573 INFO L226 Difference]: Without dead ends: 389 [2019-01-07 22:18:43,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-07 22:18:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-07 22:18:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-07 22:18:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-07 22:18:43,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-07 22:18:43,697 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-07 22:18:43,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:18:43,698 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-07 22:18:43,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-07 22:18:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-07 22:18:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-07 22:18:43,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:18:43,699 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-07 22:18:43,699 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:18:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:18:43,699 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-07 22:18:43,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:18:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:43,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:18:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:18:43,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:18:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:18:46,599 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:46,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:46,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:18:46,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:18:46,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:18:46,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:18:46,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:18:46,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:18:46,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:18:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:18:46,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:18:46,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:18:46,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:18:46,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:18:46,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:18:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:50,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:18:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:18:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:18:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-07 22:18:54,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:18:54,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-07 22:18:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-07 22:18:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:18:54,546 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-07 22:18:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:18:59,949 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-07 22:18:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-07 22:18:59,949 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-07 22:18:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:18:59,951 INFO L225 Difference]: With dead ends: 395 [2019-01-07 22:18:59,951 INFO L226 Difference]: Without dead ends: 394 [2019-01-07 22:18:59,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-07 22:18:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-07 22:19:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-07 22:19:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-07 22:19:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-07 22:19:00,068 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-07 22:19:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:19:00,068 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-07 22:19:00,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-07 22:19:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-07 22:19:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-07 22:19:00,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:19:00,070 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-07 22:19:00,070 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:19:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:19:00,070 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-07 22:19:00,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:19:00,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:00,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:19:00,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:00,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:19:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:19:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:03,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:03,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:19:03,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:19:03,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:19:03,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:03,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:19:03,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:19:03,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:19:03,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-07 22:19:03,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:19:03,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:19:03,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:19:03,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:19:03,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:19:03,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:19:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:07,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:19:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:11,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:19:11,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-07 22:19:11,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:19:11,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-07 22:19:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-07 22:19:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-07 22:19:11,467 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-07 22:19:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:19:17,031 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-07 22:19:17,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-07 22:19:17,031 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-07 22:19:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:19:17,033 INFO L225 Difference]: With dead ends: 400 [2019-01-07 22:19:17,033 INFO L226 Difference]: Without dead ends: 399 [2019-01-07 22:19:17,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-07 22:19:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-07 22:19:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-07 22:19:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-07 22:19:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-07 22:19:17,159 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-07 22:19:17,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:19:17,159 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-07 22:19:17,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-07 22:19:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-07 22:19:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-07 22:19:17,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:19:17,161 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-07 22:19:17,161 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:19:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:19:17,161 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-07 22:19:17,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:19:17,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:17,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:19:17,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:17,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:19:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:19:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:20,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:20,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:19:20,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:19:20,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:19:20,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:20,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:19:20,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:19:20,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:19:20,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:19:20,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:19:20,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:19:20,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:19:20,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:19:20,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:19:20,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:19:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:24,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:19:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:19:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-07 22:19:28,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:19:28,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-07 22:19:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-07 22:19:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 22:19:28,478 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-07 22:19:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:19:33,967 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-07 22:19:33,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 22:19:33,967 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-07 22:19:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:19:33,969 INFO L225 Difference]: With dead ends: 405 [2019-01-07 22:19:33,969 INFO L226 Difference]: Without dead ends: 404 [2019-01-07 22:19:33,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-07 22:19:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-07 22:19:34,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-07 22:19:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-07 22:19:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-07 22:19:34,097 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-07 22:19:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:19:34,098 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-07 22:19:34,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-07 22:19:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-07 22:19:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-07 22:19:34,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:19:34,099 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-07 22:19:34,099 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:19:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:19:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-07 22:19:34,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:19:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:34,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:19:34,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:34,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:19:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:19:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:37,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:37,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:19:37,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:19:37,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:19:37,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:37,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:19:37,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:19:37,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:19:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:19:37,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:19:37,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:19:37,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:19:37,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:19:37,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:19:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:41,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:19:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:45,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:19:45,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-07 22:19:45,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:19:45,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-07 22:19:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-07 22:19:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-07 22:19:45,575 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-07 22:19:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:19:51,197 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-07 22:19:51,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-07 22:19:51,197 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-07 22:19:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:19:51,199 INFO L225 Difference]: With dead ends: 410 [2019-01-07 22:19:51,199 INFO L226 Difference]: Without dead ends: 409 [2019-01-07 22:19:51,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-07 22:19:51,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-07 22:19:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-07 22:19:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-07 22:19:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-07 22:19:51,395 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-07 22:19:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:19:51,395 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-07 22:19:51,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-07 22:19:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-07 22:19:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-07 22:19:51,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:19:51,397 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-07 22:19:51,397 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:19:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:19:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-07 22:19:51,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:19:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:19:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:19:51,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:19:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:19:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:54,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:54,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:19:54,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:19:54,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:19:54,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:19:54,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:19:54,527 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:19:54,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:19:55,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-07 22:19:55,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:19:55,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:19:55,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:19:55,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:19:55,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:19:55,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:19:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:19:59,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:20:03,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:03,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:20:03,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-07 22:20:03,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:20:03,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-07 22:20:03,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-07 22:20:03,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:20:03,512 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-07 22:20:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:20:09,435 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-07 22:20:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-07 22:20:09,435 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-07 22:20:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:20:09,437 INFO L225 Difference]: With dead ends: 415 [2019-01-07 22:20:09,437 INFO L226 Difference]: Without dead ends: 414 [2019-01-07 22:20:09,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-07 22:20:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-07 22:20:09,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-07 22:20:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-07 22:20:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-07 22:20:09,571 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-07 22:20:09,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:20:09,572 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-07 22:20:09,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-07 22:20:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-07 22:20:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-07 22:20:09,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:20:09,573 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-07 22:20:09,573 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:20:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:20:09,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-07 22:20:09,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:20:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:09,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:20:09,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:09,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:20:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:20:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:12,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:12,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:20:12,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:20:12,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:20:12,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:12,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:20:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:20:12,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:20:13,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:20:13,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:20:13,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:20:13,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:20:13,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:20:13,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:20:13,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:20:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:17,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:20:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:20:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-07 22:20:21,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:20:21,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-07 22:20:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-07 22:20:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-07 22:20:21,302 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-07 22:20:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:20:27,226 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-07 22:20:27,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 22:20:27,227 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-07 22:20:27,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:20:27,228 INFO L225 Difference]: With dead ends: 420 [2019-01-07 22:20:27,228 INFO L226 Difference]: Without dead ends: 419 [2019-01-07 22:20:27,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-07 22:20:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-07 22:20:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-07 22:20:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-07 22:20:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-07 22:20:27,378 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-07 22:20:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:20:27,379 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-07 22:20:27,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-07 22:20:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-07 22:20:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-07 22:20:27,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:20:27,380 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-07 22:20:27,381 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:20:27,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:20:27,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-07 22:20:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:20:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:27,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:20:27,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:27,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:20:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:20:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:30,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:30,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:20:30,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:20:30,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:20:30,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:30,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:20:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:20:30,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:20:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:20:30,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:20:30,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:20:30,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:20:30,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:20:30,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 22:20:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:34,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:20:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:39,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:20:39,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-07 22:20:39,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:20:39,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-07 22:20:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-07 22:20:39,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 22:20:39,210 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-07 22:20:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:20:45,244 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-07 22:20:45,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-07 22:20:45,244 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-07 22:20:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:20:45,245 INFO L225 Difference]: With dead ends: 425 [2019-01-07 22:20:45,245 INFO L226 Difference]: Without dead ends: 424 [2019-01-07 22:20:45,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-07 22:20:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-07 22:20:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-07 22:20:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-07 22:20:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-07 22:20:45,398 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-07 22:20:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:20:45,398 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-07 22:20:45,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-07 22:20:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-07 22:20:45,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-07 22:20:45,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:20:45,400 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-07 22:20:45,400 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 22:20:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:20:45,401 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-07 22:20:45,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:20:45,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:45,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:20:45,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:20:45,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:20:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:20:48,820 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:20:48,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:48,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:20:48,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:20:48,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:20:48,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:20:48,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:20:48,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:20:48,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:20:49,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-07 22:20:49,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:20:49,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:20:49,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-07 22:20:49,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 22:20:49,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 22:20:49,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9