java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:10:37,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:37,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:37,718 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:37,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:37,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:37,721 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:37,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:37,725 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:37,726 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:37,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:37,727 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:37,728 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:37,729 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:37,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:37,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:37,732 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:37,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:37,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:37,738 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:37,739 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:37,740 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:37,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:37,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:37,743 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:37,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:37,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:37,746 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:37,747 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:37,748 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:37,748 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:37,749 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:37,749 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:37,749 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:37,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:37,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:37,753 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 14:10:37,777 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:37,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:37,779 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:37,779 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:37,779 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:37,780 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:37,780 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:37,780 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:37,780 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:37,780 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:37,781 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:37,781 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:37,782 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:37,782 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:37,783 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:37,783 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:37,783 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:37,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:37,784 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:37,785 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:37,785 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:37,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:37,786 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:37,786 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:37,786 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:37,786 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:37,787 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:37,787 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:37,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:37,787 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:37,788 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:37,788 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:37,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:37,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:37,788 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:37,789 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:37,789 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:37,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:37,790 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:37,790 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:37,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:37,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:37,857 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:37,859 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:37,859 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:37,860 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-11 14:10:37,860 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-11 14:10:37,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:37,918 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:37,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:37,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:37,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:37,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,960 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 14:10:37,960 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 14:10:37,961 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 14:10:37,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:37,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:37,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:37,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:37,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:37,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:38,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:38,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/1) ... [2019-01-11 14:10:38,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:38,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:38,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:38,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:38,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:10:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 14:10:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 14:10:38,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 14:10:38,073 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-11 14:10:38,434 INFO L278 CfgBuilder]: Using library mode [2019-01-11 14:10:38,435 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 14:10:38,436 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:38 BoogieIcfgContainer [2019-01-11 14:10:38,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:38,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:38,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:38,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:38,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:37" (1/2) ... [2019-01-11 14:10:38,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f836766 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:38, skipping insertion in model container [2019-01-11 14:10:38,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:38" (2/2) ... [2019-01-11 14:10:38,444 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-11 14:10:38,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:38,461 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-11 14:10:38,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-11 14:10:38,510 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:38,510 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:38,510 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:38,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:38,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:38,511 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:38,511 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:38,511 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 14:10:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:10:38,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:10:38,536 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:38,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-11 14:10:38,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:38,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:38,769 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-11 14:10:38,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:38,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:10:38,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:38,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:38,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:38,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:10:38,794 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-11 14:10:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:38,931 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-11 14:10:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:10:38,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:10:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:38,945 INFO L225 Difference]: With dead ends: 20 [2019-01-11 14:10:38,945 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 14:10:38,948 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-11 14:10:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 14:10:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-11 14:10:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:10:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 14:10:38,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-11 14:10:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:38,982 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 14:10:38,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 14:10:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:10:38,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:10:38,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-11 14:10:38,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:38,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,112 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-11 14:10:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:10:39,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:39,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:10:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:10:39,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:10:39,116 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-11 14:10:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:39,319 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-11 14:10:39,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:39,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 14:10:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:39,320 INFO L225 Difference]: With dead ends: 17 [2019-01-11 14:10:39,321 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 14:10:39,322 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-11 14:10:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 14:10:39,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-11 14:10:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:39,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-11 14:10:39,327 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-11 14:10:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:39,328 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-11 14:10:39,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:10:39,328 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-11 14:10:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:10:39,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:39,329 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 14:10:39,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-11 14:10:39,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:39,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,380 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-11 14:10:39,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:39,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:10:39,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:39,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:39,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:39,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:39,382 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-11 14:10:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:39,400 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-11 14:10:39,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:39,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-11 14:10:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:39,402 INFO L225 Difference]: With dead ends: 18 [2019-01-11 14:10:39,402 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:10:39,402 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-11 14:10:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:10:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 14:10:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 14:10:39,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-11 14:10:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:39,406 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 14:10:39,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 14:10:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:10:39,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:39,407 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-11 14:10:39,408 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-11 14:10:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:39,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:39,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,642 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-11 14:10:39,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:39,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 14:10:39,648 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-11 14:10:39,697 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:39,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:39,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:39,899 INFO L272 AbstractInterpreter]: Visited 7 different actions 25 times. Merged at 6 different actions 18 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:10:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:39,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:39,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:39,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:40,132 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-11 14:10:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:40,178 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-11 14:10:40,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:40,319 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-11 14:10:40,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:40,463 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-11 14:10:40,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:40,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:10:40,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:40,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:10:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:10:40,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:10:40,494 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-11 14:10:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:40,777 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-11 14:10:40,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:10:40,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-11 14:10:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:40,778 INFO L225 Difference]: With dead ends: 20 [2019-01-11 14:10:40,778 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 14:10:40,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 14:10:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-11 14:10:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 14:10:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-11 14:10:40,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-11 14:10:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:40,784 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-11 14:10:40,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:10:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-11 14:10:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 14:10:40,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:40,785 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-11 14:10:40,785 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-11 14:10:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:40,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:40,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:40,957 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-11 14:10:40,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:40,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:40,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:40,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:40,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 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-11 14:10:40,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:40,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:41,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:10:41,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:41,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:41,057 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-11 14:10:41,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:41,143 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-11 14:10:41,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:41,370 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-11 14:10:41,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:41,475 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-11 14:10:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:41,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:10:41,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:10:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:10:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:41,498 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-11 14:10:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:41,670 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-11 14:10:41,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:41,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-11 14:10:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:41,674 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:10:41,674 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 14:10:41,675 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-11 14:10:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 14:10:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-11 14:10:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 14:10:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 14:10:41,680 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-11 14:10:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:41,680 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 14:10:41,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:10:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 14:10:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 14:10:41,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:41,682 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-11 14:10:41,682 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:41,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-11 14:10:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:41,848 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-11 14:10:41,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:41,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:41,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:41,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,849 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-11 14:10:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:41,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:41,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:41,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:41,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:41,901 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-11 14:10:41,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:41,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-11 14:10:41,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:42,051 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-11 14:10:42,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:42,206 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-11 14:10:42,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:42,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:10:42,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:42,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:10:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:10:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:10:42,226 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-11 14:10:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:42,409 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-11 14:10:42,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:10:42,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-11 14:10:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:42,412 INFO L225 Difference]: With dead ends: 30 [2019-01-11 14:10:42,413 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 14:10:42,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:42,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 14:10:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-11 14:10:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 14:10:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-11 14:10:42,420 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-11 14:10:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:42,420 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-11 14:10:42,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:10:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-11 14:10:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 14:10:42,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:42,421 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-11 14:10:42,421 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:42,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-11 14:10:42,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:42,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:42,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:42,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,653 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-11 14:10:42,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:42,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:42,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:42,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,655 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-11 14:10:42,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:42,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:42,720 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-11 14:10:42,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:42,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-11 14:10:42,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:42,851 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-11 14:10:42,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:42,939 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-11 14:10:42,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:42,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:10:42,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:42,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:10:42,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:10:42,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:10:42,959 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-11 14:10:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:43,213 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 14:10:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:10:43,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-11 14:10:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:43,215 INFO L225 Difference]: With dead ends: 35 [2019-01-11 14:10:43,215 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 14:10:43,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:43,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 14:10:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-11 14:10:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:10:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-11 14:10:43,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-11 14:10:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:43,223 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-11 14:10:43,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:10:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-11 14:10:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 14:10:43,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:43,224 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-11 14:10:43,224 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-11 14:10:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:43,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:43,403 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-11 14:10:43,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:43,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:43,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:43,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:43,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:43,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:43,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 14:10:43,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:43,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:43,466 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-11 14:10:43,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:43,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-11 14:10:43,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:43,603 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-11 14:10:43,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:43,704 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-11 14:10:43,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:43,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-11 14:10:43,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:43,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 14:10:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 14:10:43,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:10:43,733 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-11 14:10:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:44,316 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-11 14:10:44,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:10:44,320 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-11 14:10:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:44,321 INFO L225 Difference]: With dead ends: 40 [2019-01-11 14:10:44,321 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 14:10:44,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:44,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 14:10:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-11 14:10:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 14:10:44,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-11 14:10:44,329 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-11 14:10:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:44,329 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-11 14:10:44,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 14:10:44,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-11 14:10:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 14:10:44,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:44,330 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-11 14:10:44,330 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-11 14:10:44,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:44,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:44,565 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-11 14:10:44,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:44,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:44,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:44,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,566 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-11 14:10:44,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:44,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:44,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:44,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:44,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:44,621 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-11 14:10:44,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:44,634 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-11 14:10:44,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:44,778 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-11 14:10:44,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:44,956 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-11 14:10:44,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:44,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-11 14:10:44,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:44,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 14:10:44,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 14:10:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-11 14:10:44,976 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-11 14:10:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:45,370 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-11 14:10:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:10:45,371 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-11 14:10:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:45,372 INFO L225 Difference]: With dead ends: 45 [2019-01-11 14:10:45,372 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 14:10:45,373 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-11 14:10:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 14:10:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-11 14:10:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:10:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 14:10:45,380 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-11 14:10:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:45,380 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 14:10:45,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 14:10:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 14:10:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 14:10:45,382 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:45,382 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-11 14:10:45,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-11 14:10:45,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:45,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:45,783 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-11 14:10:45,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:45,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:45,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:45,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:10:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:45,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:45,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:45,829 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-11 14:10:45,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:45,837 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-11 14:10:45,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:46,087 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-11 14:10:46,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:46,522 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-11 14:10:46,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:46,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-11 14:10:46,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 14:10:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 14:10:46,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-11 14:10:46,543 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-11 14:10:46,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:46,830 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-11 14:10:46,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:10:46,830 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-11 14:10:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:46,831 INFO L225 Difference]: With dead ends: 50 [2019-01-11 14:10:46,831 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 14:10:46,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 14:10:46,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-11 14:10:46,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 14:10:46,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-11 14:10:46,841 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-11 14:10:46,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:46,842 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-11 14:10:46,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 14:10:46,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-11 14:10:46,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 14:10:46,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:46,843 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-11 14:10:46,843 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:46,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-11 14:10:46,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:46,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:46,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:47,598 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-11 14:10:47,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:47,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:47,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:47,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:47,599 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-11 14:10:47,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:47,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:47,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 14:10:47,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:47,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:47,676 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-11 14:10:47,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:47,685 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-11 14:10:47,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:48,049 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-11 14:10:48,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:48,265 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-11 14:10:48,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-11 14:10:48,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:48,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 14:10:48,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 14:10:48,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:48,285 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-11 14:10:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:48,656 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 14:10:48,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 14:10:48,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-11 14:10:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:48,658 INFO L225 Difference]: With dead ends: 55 [2019-01-11 14:10:48,658 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 14:10:48,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 14:10:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 14:10:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-11 14:10:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:10:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-11 14:10:48,668 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-11 14:10:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:48,669 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-11 14:10:48,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 14:10:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-11 14:10:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 14:10:48,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:48,670 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-11 14:10:48,670 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:48,670 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-11 14:10:48,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:48,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:49,084 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-11 14:10:49,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:49,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:49,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:49,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:49,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:49,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 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-11 14:10:49,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:49,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:49,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:49,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:49,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:49,140 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-11 14:10:49,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:49,149 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-11 14:10:49,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:49,432 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-11 14:10:49,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:49,631 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-11 14:10:49,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:49,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-11 14:10:49,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:49,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 14:10:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 14:10:49,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 14:10:49,652 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-11 14:10:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:50,029 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-11 14:10:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 14:10:50,029 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-11 14:10:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:50,030 INFO L225 Difference]: With dead ends: 60 [2019-01-11 14:10:50,030 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 14:10:50,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 14:10:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 14:10:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-11 14:10:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 14:10:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-11 14:10:50,040 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-11 14:10:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:50,041 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-11 14:10:50,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 14:10:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-11 14:10:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 14:10:50,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:50,042 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-11 14:10:50,042 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:50,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-11 14:10:50,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:50,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:50,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:50,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,285 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-11 14:10:50,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:50,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:50,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:50,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,286 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-11 14:10:50,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:50,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:50,353 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-11 14:10:50,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:50,362 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-11 14:10:50,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:50,759 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-11 14:10:50,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:51,094 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-11 14:10:51,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:51,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-11 14:10:51,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:51,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 14:10:51,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 14:10:51,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:51,115 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-11 14:10:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:51,571 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-11 14:10:51,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 14:10:51,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-11 14:10:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:51,573 INFO L225 Difference]: With dead ends: 65 [2019-01-11 14:10:51,573 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 14:10:51,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 14:10:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-11 14:10:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:10:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 14:10:51,587 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-11 14:10:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:51,588 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 14:10:51,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 14:10:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 14:10:51,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 14:10:51,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:51,589 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-11 14:10:51,589 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:51,590 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-11 14:10:51,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:51,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:51,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:51,931 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-11 14:10:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:51,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:51,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:51,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:51,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:51,932 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-11 14:10:51,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:51,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:51,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 14:10:51,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:51,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:52,008 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-11 14:10:52,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:52,016 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-11 14:10:52,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:52,232 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-11 14:10:52,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:52,513 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-11 14:10:52,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:52,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-11 14:10:52,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:52,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 14:10:52,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 14:10:52,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 14:10:52,533 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-11 14:10:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:53,023 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-11 14:10:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 14:10:53,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-11 14:10:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:53,024 INFO L225 Difference]: With dead ends: 70 [2019-01-11 14:10:53,024 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 14:10:53,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 14:10:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 14:10:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-11 14:10:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 14:10:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-11 14:10:53,036 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-11 14:10:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:53,036 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-11 14:10:53,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 14:10:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-11 14:10:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 14:10:53,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:53,037 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-11 14:10:53,037 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-11 14:10:53,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:53,826 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-11 14:10:53,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:53,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:53,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:53,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,827 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-11 14:10:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:53,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:53,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:53,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:53,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:53,943 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-11 14:10:53,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:53,997 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-11 14:10:53,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:54,223 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-11 14:10:54,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:54,739 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-11 14:10:54,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-11 14:10:54,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:54,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 14:10:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 14:10:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 14:10:54,761 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-11 14:10:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:55,356 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 14:10:55,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 14:10:55,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-11 14:10:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:55,357 INFO L225 Difference]: With dead ends: 75 [2019-01-11 14:10:55,357 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 14:10:55,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 14:10:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 14:10:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-11 14:10:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:10:55,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-11 14:10:55,372 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-11 14:10:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:55,373 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-11 14:10:55,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 14:10:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-11 14:10:55,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 14:10:55,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:55,374 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-11 14:10:55,374 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-11 14:10:55,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:55,876 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-11 14:10:55,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:55,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:55,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:55,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,877 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-11 14:10:55,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:55,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:55,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:55,943 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-11 14:10:55,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:55,952 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-11 14:10:55,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:56,376 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-11 14:10:56,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:57,250 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-11 14:10:57,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:57,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-11 14:10:57,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:57,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 14:10:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 14:10:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 14:10:57,272 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-11 14:10:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:57,971 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-11 14:10:57,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 14:10:57,971 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-11 14:10:57,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:57,972 INFO L225 Difference]: With dead ends: 80 [2019-01-11 14:10:57,972 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 14:10:57,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:10:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 14:10:57,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-11 14:10:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 14:10:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-11 14:10:57,984 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-11 14:10:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:57,984 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-11 14:10:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 14:10:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-11 14:10:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 14:10:57,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:57,986 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-11 14:10:57,986 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:57,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-11 14:10:57,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:57,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:58,385 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-11 14:10:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:58,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:58,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:58,385 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-11 14:10:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:58,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:58,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 14:10:58,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:58,506 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-11 14:10:58,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:58,529 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-11 14:10:58,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:10:58,752 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-11 14:10:58,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:59,124 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-11 14:10:59,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-11 14:10:59,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:59,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 14:10:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 14:10:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:59,145 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-11 14:10:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:59,645 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-11 14:10:59,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 14:10:59,645 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-11 14:10:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:59,646 INFO L225 Difference]: With dead ends: 85 [2019-01-11 14:10:59,646 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 14:10:59,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:10:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 14:10:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-11 14:10:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 14:10:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 14:10:59,661 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-11 14:10:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 14:10:59,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 14:10:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 14:10:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 14:10:59,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:59,663 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-11 14:10:59,663 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:10:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-11 14:10:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:59,950 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-11 14:10:59,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:59,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:59,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:59,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,951 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-11 14:10:59,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:59,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:00,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:00,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:00,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:00,034 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-11 14:11:00,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:00,049 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-11 14:11:00,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:00,797 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-11 14:11:00,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:01,383 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-11 14:11:01,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:01,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-11 14:11:01,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:01,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 14:11:01,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 14:11:01,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 14:11:01,404 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-11 14:11:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:02,019 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-11 14:11:02,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 14:11:02,019 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-11 14:11:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:02,020 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:11:02,020 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:11:02,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:02,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:11:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-11 14:11:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-11 14:11:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-11 14:11:02,034 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-11 14:11:02,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:02,035 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-11 14:11:02,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 14:11:02,035 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-11 14:11:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 14:11:02,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:02,036 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-11 14:11:02,036 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-11 14:11:02,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:02,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:02,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,335 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-11 14:11:02,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:02,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:02,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:02,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,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 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-11 14:11:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:02,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:02,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:11:02,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:02,425 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-11 14:11:02,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:02,707 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-11 14:11:02,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:03,172 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-11 14:11:03,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-11 14:11:03,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:03,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 14:11:03,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 14:11:03,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 14:11:03,193 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-11 14:11:03,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:03,756 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 14:11:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 14:11:03,756 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-11 14:11:03,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:03,757 INFO L225 Difference]: With dead ends: 95 [2019-01-11 14:11:03,757 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 14:11:03,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 14:11:03,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-11 14:11:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:11:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-11 14:11:03,770 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-11 14:11:03,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:03,770 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-11 14:11:03,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 14:11:03,770 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-11 14:11:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 14:11:03,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:03,771 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-11 14:11:03,771 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:03,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:03,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-11 14:11:03,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:03,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:03,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:04,201 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-11 14:11:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:04,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:04,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:04,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:11:04,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:04,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:04,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 14:11:04,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:04,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:04,304 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-11 14:11:04,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:04,315 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-11 14:11:04,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:04,703 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-11 14:11:04,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:05,420 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-11 14:11:05,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:05,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-11 14:11:05,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:05,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 14:11:05,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 14:11:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 14:11:05,441 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-11 14:11:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:06,129 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-11 14:11:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 14:11:06,130 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-11 14:11:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:06,130 INFO L225 Difference]: With dead ends: 100 [2019-01-11 14:11:06,130 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 14:11:06,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:11:06,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 14:11:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-11 14:11:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 14:11:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-11 14:11:06,142 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-11 14:11:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:06,142 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-11 14:11:06,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 14:11:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-11 14:11:06,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 14:11:06,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:06,143 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-11 14:11:06,143 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-11 14:11:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:06,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:06,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:06,506 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-11 14:11:06,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:06,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:06,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:06,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,506 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-11 14:11:06,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:06,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:06,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:06,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:06,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:06,588 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-11 14:11:06,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:06,607 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-11 14:11:06,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:06,945 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-11 14:11:06,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:07,531 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-11 14:11:07,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:07,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-11 14:11:07,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 14:11:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 14:11:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:11:07,551 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-11 14:11:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:08,186 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-11 14:11:08,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 14:11:08,187 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-11 14:11:08,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:08,188 INFO L225 Difference]: With dead ends: 105 [2019-01-11 14:11:08,188 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 14:11:08,189 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-11 14:11:08,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 14:11:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-11 14:11:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 14:11:08,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 14:11:08,201 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-11 14:11:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:08,201 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 14:11:08,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 14:11:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 14:11:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 14:11:08,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:08,202 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-11 14:11:08,202 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-11 14:11:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:08,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:08,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:08,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:08,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:08,734 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-11 14:11:08,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:08,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:08,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:08,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:08,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:08,735 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-11 14:11:08,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:08,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:08,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:08,814 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-11 14:11:08,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:08,835 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-11 14:11:08,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:09,228 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-11 14:11:09,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:09,835 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-11 14:11:09,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:09,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-11 14:11:09,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:09,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 14:11:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 14:11:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 14:11:09,855 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-11 14:11:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:10,594 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-11 14:11:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 14:11:10,596 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-11 14:11:10,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:10,597 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:11:10,597 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 14:11:10,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:11:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 14:11:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-11 14:11:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 14:11:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-11 14:11:10,609 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-11 14:11:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:10,610 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-11 14:11:10,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 14:11:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-11 14:11:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 14:11:10,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:10,610 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-11 14:11:10,611 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-11 14:11:10,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:10,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:10,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:11,713 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-11 14:11:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:11,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:11,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,714 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-11 14:11:11,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:11,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:11,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 14:11:11,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:11,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:11,830 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-11 14:11:11,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:11,839 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-11 14:11:11,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:12,204 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-11 14:11:12,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:13,144 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-11 14:11:13,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:13,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-11 14:11:13,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:13,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 14:11:13,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 14:11:13,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 14:11:13,164 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-11 14:11:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:13,928 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 14:11:13,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 14:11:13,929 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-11 14:11:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:13,930 INFO L225 Difference]: With dead ends: 115 [2019-01-11 14:11:13,930 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 14:11:13,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 14:11:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 14:11:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-11 14:11:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 14:11:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-11 14:11:13,945 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-11 14:11:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:13,946 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-11 14:11:13,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 14:11:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-11 14:11:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 14:11:13,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:13,947 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-11 14:11:13,947 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-11 14:11:13,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:13,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:13,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:13,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:13,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:14,336 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-11 14:11:14,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:14,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:14,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:14,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:14,337 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-11 14:11:14,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:14,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:14,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:14,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:14,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:14,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:11:14,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:14,441 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-11 14:11:14,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:14,859 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-11 14:11:14,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:15,560 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-11 14:11:15,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:15,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-11 14:11:15,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:15,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 14:11:15,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 14:11:15,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 14:11:15,581 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-11 14:11:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:16,607 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-11 14:11:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 14:11:16,608 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-11 14:11:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:16,609 INFO L225 Difference]: With dead ends: 120 [2019-01-11 14:11:16,609 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 14:11:16,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 14:11:16,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-11 14:11:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 14:11:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-11 14:11:16,628 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-11 14:11:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:16,628 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-11 14:11:16,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 14:11:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-11 14:11:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-11 14:11:16,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:16,630 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-11 14:11:16,630 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:16,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-11 14:11:16,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:16,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:16,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:16,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:17,033 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-11 14:11:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:17,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:17,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:17,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:17,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:11:17,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:17,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:17,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:17,140 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-11 14:11:17,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:17,227 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-11 14:11:17,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:17,688 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-11 14:11:17,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:18,490 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-11 14:11:18,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:18,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-11 14:11:18,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:18,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 14:11:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 14:11:18,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:18,510 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-11 14:11:19,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:19,528 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-11 14:11:19,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 14:11:19,529 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-11 14:11:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:19,530 INFO L225 Difference]: With dead ends: 125 [2019-01-11 14:11:19,530 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 14:11:19,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:11:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 14:11:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-11 14:11:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 14:11:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-11 14:11:19,543 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-11 14:11:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:19,544 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-11 14:11:19,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 14:11:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-11 14:11:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 14:11:19,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:19,544 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-11 14:11:19,544 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:19,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:19,545 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-11 14:11:19,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:19,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:19,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:20,041 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-11 14:11:20,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:20,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:20,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:20,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:20,041 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-11 14:11:20,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:20,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:20,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 14:11:20,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:20,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:20,181 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-11 14:11:20,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:20,192 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-11 14:11:20,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:20,641 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-11 14:11:20,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:21,770 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-11 14:11:21,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:21,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-11 14:11:21,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:21,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 14:11:21,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 14:11:21,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 14:11:21,791 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-11 14:11:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:22,736 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-11 14:11:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 14:11:22,736 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-11 14:11:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:22,737 INFO L225 Difference]: With dead ends: 130 [2019-01-11 14:11:22,737 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 14:11:22,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:11:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 14:11:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-11 14:11:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 14:11:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-11 14:11:22,756 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-11 14:11:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:22,756 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-11 14:11:22,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 14:11:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-11 14:11:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-11 14:11:22,757 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:22,757 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-11 14:11:22,758 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-11 14:11:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:22,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:22,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:22,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:22,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:23,881 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-11 14:11:23,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:23,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:23,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:23,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,882 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-11 14:11:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:23,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:23,971 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:23,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:23,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:23,994 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-11 14:11:23,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:24,009 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-11 14:11:24,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:24,516 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-11 14:11:24,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:25,469 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-11 14:11:25,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:25,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-11 14:11:25,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:25,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 14:11:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 14:11:25,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:25,489 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-11 14:11:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:26,652 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-11 14:11:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 14:11:26,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-11 14:11:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:26,653 INFO L225 Difference]: With dead ends: 135 [2019-01-11 14:11:26,653 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 14:11:26,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:11:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 14:11:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-11 14:11:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 14:11:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-11 14:11:26,674 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-11 14:11:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-11 14:11:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 14:11:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-11 14:11:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 14:11:26,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:26,675 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-11 14:11:26,675 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:26,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-11 14:11:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:26,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:26,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:27,257 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-11 14:11:27,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:27,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:27,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:27,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:27,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:27,258 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-11 14:11:27,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:27,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:27,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:27,370 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-11 14:11:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:27,382 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-11 14:11:27,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:27,926 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-11 14:11:27,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:28,897 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-11 14:11:28,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:28,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-11 14:11:28,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:28,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 14:11:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 14:11:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 14:11:28,918 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-11 14:11:30,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:30,017 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-11 14:11:30,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 14:11:30,018 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-11 14:11:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:30,019 INFO L225 Difference]: With dead ends: 140 [2019-01-11 14:11:30,019 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 14:11:30,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 14:11:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 14:11:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-11 14:11:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 14:11:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-11 14:11:30,040 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-11 14:11:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:30,041 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-11 14:11:30,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 14:11:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-11 14:11:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-11 14:11:30,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:30,042 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-11 14:11:30,042 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:30,042 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-11 14:11:30,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:30,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:30,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:30,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:30,778 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-11 14:11:30,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:30,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:30,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:30,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:30,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:30,779 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-11 14:11:30,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:30,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:30,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 14:11:30,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:30,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:30,962 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-11 14:11:30,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:31,057 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-11 14:11:31,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:32,461 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-11 14:11:32,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:33,569 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-11 14:11:33,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-11 14:11:33,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 14:11:33,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 14:11:33,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:11:33,590 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-11 14:11:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:34,635 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-11 14:11:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 14:11:34,635 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-11 14:11:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:34,636 INFO L225 Difference]: With dead ends: 145 [2019-01-11 14:11:34,636 INFO L226 Difference]: Without dead ends: 144 [2019-01-11 14:11:34,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 14:11:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-11 14:11:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-11 14:11:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 14:11:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-11 14:11:34,656 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-11 14:11:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:34,657 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-11 14:11:34,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 14:11:34,657 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-11 14:11:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-11 14:11:34,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:34,658 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-11 14:11:34,658 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:34,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:34,658 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-11 14:11:34,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:34,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:34,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:34,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:34,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:35,281 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-11 14:11:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:35,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:35,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:35,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:35,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:35,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 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-11 14:11:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:35,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:35,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:35,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:35,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:35,392 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-11 14:11:35,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:35,403 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-11 14:11:35,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:36,151 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-11 14:11:36,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:37,532 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-11 14:11:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:37,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-11 14:11:37,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:37,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 14:11:37,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 14:11:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 14:11:37,552 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-11 14:11:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:38,817 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-11 14:11:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 14:11:38,817 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-11 14:11:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:38,818 INFO L225 Difference]: With dead ends: 150 [2019-01-11 14:11:38,818 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 14:11:38,819 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-11 14:11:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 14:11:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-11 14:11:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-11 14:11:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-11 14:11:38,838 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-11 14:11:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:38,838 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-11 14:11:38,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 14:11:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-11 14:11:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-11 14:11:38,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:38,839 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-11 14:11:38,840 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:38,840 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-11 14:11:38,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:38,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:38,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:38,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:38,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:39,537 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-11 14:11:39,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:39,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:39,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:39,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:39,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:39,538 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-11 14:11:39,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:39,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:39,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:39,648 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-11 14:11:39,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:39,665 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-11 14:11:39,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:40,340 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-11 14:11:40,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:41,533 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-11 14:11:41,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:41,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-11 14:11:41,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:41,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 14:11:41,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 14:11:41,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:11:41,552 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-11 14:11:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:42,817 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-11 14:11:42,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 14:11:42,818 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-11 14:11:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:42,819 INFO L225 Difference]: With dead ends: 155 [2019-01-11 14:11:42,819 INFO L226 Difference]: Without dead ends: 154 [2019-01-11 14:11:42,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 14:11:42,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-11 14:11:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-11 14:11:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-11 14:11:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-11 14:11:42,837 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-11 14:11:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:42,837 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-11 14:11:42,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 14:11:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-11 14:11:42,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 14:11:42,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:42,838 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-11 14:11:42,838 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-11 14:11:42,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:42,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:42,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:44,078 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-11 14:11:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:44,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:44,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:44,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:44,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:44,079 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-11 14:11:44,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:44,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:44,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 14:11:44,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:44,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:44,255 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-11 14:11:44,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:44,266 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-11 14:11:44,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:45,156 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-11 14:11:45,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:46,414 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-11 14:11:46,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:46,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-11 14:11:46,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:46,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 14:11:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 14:11:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 14:11:46,434 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-11 14:11:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:47,816 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-11 14:11:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 14:11:47,817 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-11 14:11:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:47,818 INFO L225 Difference]: With dead ends: 160 [2019-01-11 14:11:47,818 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 14:11:47,819 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-11 14:11:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 14:11:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-11 14:11:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 14:11:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-11 14:11:47,842 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-11 14:11:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:47,842 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-11 14:11:47,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 14:11:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-11 14:11:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-11 14:11:47,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:47,844 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-11 14:11:47,844 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:47,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:47,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-11 14:11:47,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:47,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:47,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:47,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:48,539 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-11 14:11:48,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:48,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:48,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:48,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:48,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:48,540 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-11 14:11:48,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:48,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:48,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:48,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:48,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:48,654 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-11 14:11:48,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:48,665 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-11 14:11:48,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:49,345 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-11 14:11:49,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:50,944 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-11 14:11:50,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:50,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-11 14:11:50,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:50,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 14:11:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 14:11:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:11:50,965 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-11 14:11:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:52,482 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-11 14:11:52,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 14:11:52,482 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-11 14:11:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:52,483 INFO L225 Difference]: With dead ends: 165 [2019-01-11 14:11:52,483 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 14:11:52,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 14:11:52,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 14:11:52,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-11 14:11:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 14:11:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-11 14:11:52,511 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-11 14:11:52,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:52,511 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-11 14:11:52,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 14:11:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-11 14:11:52,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 14:11:52,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:52,512 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-11 14:11:52,512 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:52,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:52,513 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-11 14:11:52,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:52,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:52,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:52,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:53,248 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-11 14:11:53,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:53,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:53,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:53,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:53,249 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-11 14:11:53,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:53,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:53,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:53,359 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-11 14:11:53,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:53,370 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-11 14:11:53,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:54,137 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-11 14:11:54,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:55,617 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-11 14:11:55,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:55,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-11 14:11:55,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:55,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 14:11:55,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 14:11:55,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 14:11:55,639 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-11 14:11:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:57,467 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-11 14:11:57,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 14:11:57,468 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-11 14:11:57,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:57,470 INFO L225 Difference]: With dead ends: 170 [2019-01-11 14:11:57,470 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 14:11:57,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 14:11:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 14:11:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-11 14:11:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-11 14:11:57,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-11 14:11:57,498 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-11 14:11:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:57,499 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-11 14:11:57,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 14:11:57,499 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-11 14:11:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-11 14:11:57,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:57,500 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-11 14:11:57,500 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:11:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-11 14:11:57,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:57,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:58,293 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-11 14:11:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:58,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:58,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:58,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:58,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:58,294 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-11 14:11:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:58,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:58,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-11 14:11:58,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:58,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:58,501 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-11 14:11:58,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:11:58,510 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-11 14:11:58,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:11:59,403 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-11 14:11:59,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:01,574 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-11 14:12:01,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:01,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-11 14:12:01,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:01,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 14:12:01,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 14:12:01,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:12:01,595 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-11 14:12:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:03,204 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-11 14:12:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 14:12:03,204 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-11 14:12:03,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:03,205 INFO L225 Difference]: With dead ends: 175 [2019-01-11 14:12:03,205 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 14:12:03,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 14:12:03,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 14:12:03,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-11 14:12:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 14:12:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-11 14:12:03,240 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-11 14:12:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-11 14:12:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 14:12:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-11 14:12:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 14:12:03,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:03,242 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-11 14:12:03,242 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-11 14:12:03,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:03,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:03,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:04,407 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-11 14:12:04,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:04,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:04,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:04,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:04,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:04,408 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-11 14:12:04,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:04,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:04,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:04,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:04,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:04,550 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-11 14:12:04,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:04,589 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-11 14:12:04,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:05,401 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-11 14:12:05,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:07,006 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-11 14:12:07,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:07,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-11 14:12:07,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:07,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 14:12:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 14:12:07,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 14:12:07,027 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-11 14:12:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:08,647 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-11 14:12:08,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 14:12:08,648 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-11 14:12:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:08,649 INFO L225 Difference]: With dead ends: 180 [2019-01-11 14:12:08,649 INFO L226 Difference]: Without dead ends: 179 [2019-01-11 14:12:08,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 14:12:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-11 14:12:08,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-11 14:12:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-11 14:12:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-11 14:12:08,677 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-11 14:12:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:08,677 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-11 14:12:08,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 14:12:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-11 14:12:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 14:12:08,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:08,678 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-11 14:12:08,679 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-11 14:12:08,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:08,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:08,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:08,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:09,508 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-11 14:12:09,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:09,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:09,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:09,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:09,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:09,509 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-11 14:12:09,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:09,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:09,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:09,646 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-11 14:12:09,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:09,740 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-11 14:12:09,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:10,603 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-11 14:12:10,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:12,288 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-11 14:12:12,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:12,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-11 14:12:12,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:12,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 14:12:12,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 14:12:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 14:12:12,310 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-11 14:12:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:14,310 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-11 14:12:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 14:12:14,310 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-11 14:12:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:14,311 INFO L225 Difference]: With dead ends: 185 [2019-01-11 14:12:14,311 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 14:12:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 14:12:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 14:12:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-11 14:12:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 14:12:14,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-11 14:12:14,342 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-11 14:12:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:14,342 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-11 14:12:14,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 14:12:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-11 14:12:14,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-11 14:12:14,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:14,343 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-11 14:12:14,344 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:14,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-11 14:12:14,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:14,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:14,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:15,305 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-11 14:12:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:15,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:15,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:15,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:15,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:15,306 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-11 14:12:15,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:15,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:15,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 14:12:15,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:15,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:15,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-11 14:12:15,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:15,633 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-11 14:12:15,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:16,646 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-11 14:12:16,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:18,614 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-11 14:12:18,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:18,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-11 14:12:18,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:18,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 14:12:18,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 14:12:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 14:12:18,635 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-11 14:12:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:20,176 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-11 14:12:20,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 14:12:20,177 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-11 14:12:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:20,178 INFO L225 Difference]: With dead ends: 190 [2019-01-11 14:12:20,178 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 14:12:20,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 14:12:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 14:12:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-11 14:12:20,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 14:12:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-11 14:12:20,207 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-11 14:12:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:20,207 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-11 14:12:20,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 14:12:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-11 14:12:20,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-11 14:12:20,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:20,209 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-11 14:12:20,209 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:20,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-11 14:12:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:20,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:20,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:21,250 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-11 14:12:21,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:21,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:21,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:21,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:21,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:21,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:21,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:21,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:21,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:21,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:21,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:21,400 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-11 14:12:21,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:21,497 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-11 14:12:21,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:23,511 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-11 14:12:23,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:25,512 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-11 14:12:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-11 14:12:25,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:25,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 14:12:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 14:12:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 14:12:25,533 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-11 14:12:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:27,284 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-11 14:12:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 14:12:27,285 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-11 14:12:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:27,286 INFO L225 Difference]: With dead ends: 195 [2019-01-11 14:12:27,286 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 14:12:27,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 14:12:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 14:12:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-11 14:12:27,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 14:12:27,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-11 14:12:27,322 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-11 14:12:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:27,322 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-11 14:12:27,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 14:12:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-11 14:12:27,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-11 14:12:27,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:27,323 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-11 14:12:27,324 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:27,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:27,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-11 14:12:27,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:27,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:27,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:27,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:28,535 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-11 14:12:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:28,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:28,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:28,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:28,535 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-11 14:12:28,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:28,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:28,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:28,661 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-11 14:12:28,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:28,670 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-11 14:12:28,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:29,676 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-11 14:12:29,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:31,614 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-11 14:12:31,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:31,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-11 14:12:31,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:31,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 14:12:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 14:12:31,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 14:12:31,635 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-11 14:12:32,223 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 14:12:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:34,129 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-11 14:12:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 14:12:34,129 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-11 14:12:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:34,130 INFO L225 Difference]: With dead ends: 200 [2019-01-11 14:12:34,130 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 14:12:34,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 14:12:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 14:12:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-11 14:12:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 14:12:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-11 14:12:34,174 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-11 14:12:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:34,175 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-11 14:12:34,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 14:12:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-11 14:12:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 14:12:34,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:34,176 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-11 14:12:34,176 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-11 14:12:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:34,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:34,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:34,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:35,623 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-11 14:12:35,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:35,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:35,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:35,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:35,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:35,624 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-11 14:12:35,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:35,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:35,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-11 14:12:35,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:35,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:35,906 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-11 14:12:35,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:35,916 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-11 14:12:35,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:36,935 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-11 14:12:36,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:39,228 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-11 14:12:39,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:39,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-11 14:12:39,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:39,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 14:12:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 14:12:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 14:12:39,250 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-11 14:12:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:41,145 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-11 14:12:41,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 14:12:41,146 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-11 14:12:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:41,146 INFO L225 Difference]: With dead ends: 205 [2019-01-11 14:12:41,147 INFO L226 Difference]: Without dead ends: 204 [2019-01-11 14:12:41,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 14:12:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-11 14:12:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-11 14:12:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-11 14:12:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-11 14:12:41,181 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-11 14:12:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:41,181 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-11 14:12:41,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 14:12:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-11 14:12:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-11 14:12:41,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:41,183 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-11 14:12:41,183 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-11 14:12:41,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:41,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:41,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:41,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:41,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:42,784 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-11 14:12:42,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:42,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:42,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:42,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:42,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:42,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:12:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:42,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:42,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:42,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:42,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:42,931 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-11 14:12:42,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:42,943 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-11 14:12:42,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:44,255 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-11 14:12:44,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:46,415 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-11 14:12:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-11 14:12:46,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:46,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 14:12:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 14:12:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 14:12:46,436 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-11 14:12:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:48,371 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-11 14:12:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 14:12:48,371 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-11 14:12:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:48,372 INFO L225 Difference]: With dead ends: 210 [2019-01-11 14:12:48,372 INFO L226 Difference]: Without dead ends: 209 [2019-01-11 14:12:48,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 14:12:48,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-11 14:12:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-11 14:12:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 14:12:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-11 14:12:48,407 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-11 14:12:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:48,407 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-11 14:12:48,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 14:12:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-11 14:12:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 14:12:48,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:48,408 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-11 14:12:48,408 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:48,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:48,409 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-11 14:12:48,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:48,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:48,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:48,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:48,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:49,760 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-11 14:12:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:49,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:49,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:49,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:49,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:49,761 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-11 14:12:49,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:49,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:49,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:49,904 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-11 14:12:49,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:49,914 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-11 14:12:49,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:51,047 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-11 14:12:51,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:53,252 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-11 14:12:53,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:53,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-11 14:12:53,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:53,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 14:12:53,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 14:12:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 14:12:53,289 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-11 14:12:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:55,309 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-11 14:12:55,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 14:12:55,309 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-11 14:12:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:55,310 INFO L225 Difference]: With dead ends: 215 [2019-01-11 14:12:55,310 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 14:12:55,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 14:12:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 14:12:55,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-11 14:12:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-11 14:12:55,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-11 14:12:55,344 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-11 14:12:55,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:55,345 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-11 14:12:55,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 14:12:55,345 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-11 14:12:55,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-11 14:12:55,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:55,346 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-11 14:12:55,346 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:12:55,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:55,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-11 14:12:55,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:55,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:55,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:55,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:56,646 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-11 14:12:56,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:56,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:56,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:56,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:56,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:56,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:12:56,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:56,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:57,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-11 14:12:57,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:57,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:57,123 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-11 14:12:57,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:57,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-11 14:12:57,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:12:58,293 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-11 14:12:58,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:00,854 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-11 14:13:00,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:00,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-11 14:13:00,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:00,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 14:13:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 14:13:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 14:13:00,877 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-11 14:13:02,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:02,849 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-11 14:13:02,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 14:13:02,850 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-11 14:13:02,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:02,851 INFO L225 Difference]: With dead ends: 220 [2019-01-11 14:13:02,851 INFO L226 Difference]: Without dead ends: 219 [2019-01-11 14:13:02,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 14:13:02,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-11 14:13:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-11 14:13:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-11 14:13:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-11 14:13:02,889 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-11 14:13:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:02,889 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-11 14:13:02,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 14:13:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-11 14:13:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-11 14:13:02,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:02,890 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-11 14:13:02,890 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:02,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:02,891 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-11 14:13:02,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:02,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:02,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:02,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:04,485 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-11 14:13:04,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:04,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:04,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:04,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:04,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:04,486 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-11 14:13:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:04,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:04,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:04,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:04,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:04,640 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-11 14:13:04,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:04,656 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-11 14:13:04,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:05,854 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-11 14:13:05,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:08,340 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-11 14:13:08,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:08,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-11 14:13:08,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:08,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 14:13:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 14:13:08,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 14:13:08,361 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-11 14:13:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:10,697 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-11 14:13:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 14:13:10,698 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-11 14:13:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:10,699 INFO L225 Difference]: With dead ends: 225 [2019-01-11 14:13:10,699 INFO L226 Difference]: Without dead ends: 224 [2019-01-11 14:13:10,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 14:13:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-11 14:13:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-11 14:13:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 14:13:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-11 14:13:10,735 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-11 14:13:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:10,735 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-11 14:13:10,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 14:13:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-11 14:13:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-11 14:13:10,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:10,736 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-11 14:13:10,737 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-11 14:13:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:10,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:10,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:11,817 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-11 14:13:11,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:11,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:11,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:11,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:11,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:11,818 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-11 14:13:11,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:11,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:11,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:11,980 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-11 14:13:11,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:11,988 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-11 14:13:11,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:13,263 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-11 14:13:13,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:16,102 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-11 14:13:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:16,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-11 14:13:16,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 14:13:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 14:13:16,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 14:13:16,124 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-11 14:13:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:18,412 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-11 14:13:18,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 14:13:18,413 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-11 14:13:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:18,414 INFO L225 Difference]: With dead ends: 230 [2019-01-11 14:13:18,414 INFO L226 Difference]: Without dead ends: 229 [2019-01-11 14:13:18,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 14:13:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-11 14:13:18,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-11 14:13:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 14:13:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-11 14:13:18,463 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-11 14:13:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:18,463 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-11 14:13:18,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 14:13:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-11 14:13:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-11 14:13:18,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:18,464 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-11 14:13:18,465 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-11 14:13:18,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:18,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:20,007 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-11 14:13:20,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:20,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:20,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:20,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:20,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:20,008 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-11 14:13:20,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:13:20,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:13:20,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-11 14:13:20,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:20,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:20,298 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-11 14:13:20,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:20,310 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-11 14:13:20,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:21,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-11 14:13:21,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:24,892 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-11 14:13:24,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:24,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-11 14:13:24,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:24,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 14:13:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 14:13:24,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 14:13:24,913 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-11 14:13:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:27,302 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-11 14:13:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 14:13:27,303 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-11 14:13:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:27,304 INFO L225 Difference]: With dead ends: 235 [2019-01-11 14:13:27,304 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 14:13:27,305 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-11 14:13:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 14:13:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-11 14:13:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-11 14:13:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-11 14:13:27,364 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-11 14:13:27,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:27,365 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-11 14:13:27,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 14:13:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-11 14:13:27,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 14:13:27,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:27,366 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-11 14:13:27,366 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:27,367 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-11 14:13:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:27,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:27,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:27,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:28,591 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-11 14:13:28,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:28,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:28,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:28,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:28,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:28,592 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-11 14:13:28,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:28,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:28,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:28,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:28,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:28,762 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-11 14:13:28,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:28,770 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-11 14:13:28,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:30,410 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-11 14:13:30,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:33,206 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-11 14:13:33,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:33,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-11 14:13:33,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:33,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 14:13:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 14:13:33,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 14:13:33,227 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-11 14:13:35,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:35,771 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-11 14:13:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 14:13:35,771 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-11 14:13:35,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:35,772 INFO L225 Difference]: With dead ends: 240 [2019-01-11 14:13:35,773 INFO L226 Difference]: Without dead ends: 239 [2019-01-11 14:13:35,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 14:13:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-11 14:13:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-11 14:13:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 14:13:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-11 14:13:35,832 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-11 14:13:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:35,832 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-11 14:13:35,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 14:13:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-11 14:13:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-11 14:13:35,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:35,834 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-11 14:13:35,834 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-11 14:13:35,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:35,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:35,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:35,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:37,015 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-11 14:13:37,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:37,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:37,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:37,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:37,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:37,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:13:37,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:37,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:13:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:37,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:37,184 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-11 14:13:37,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:37,195 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-11 14:13:37,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:38,684 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-11 14:13:38,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:41,966 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-11 14:13:41,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:41,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-11 14:13:41,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:41,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 14:13:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 14:13:41,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 14:13:41,987 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-11 14:13:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:44,648 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-11 14:13:44,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 14:13:44,658 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-11 14:13:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:44,659 INFO L225 Difference]: With dead ends: 245 [2019-01-11 14:13:44,659 INFO L226 Difference]: Without dead ends: 244 [2019-01-11 14:13:44,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 14:13:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-11 14:13:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-11 14:13:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 14:13:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-11 14:13:44,713 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-11 14:13:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:44,713 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-11 14:13:44,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 14:13:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-11 14:13:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 14:13:44,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:44,715 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-11 14:13:44,715 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-11 14:13:44,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:44,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:13:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:44,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:46,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-11 14:13:46,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:46,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:46,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:46,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:46,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:46,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 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-11 14:13:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:13:46,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:13:46,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-11 14:13:46,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:46,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:46,324 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-11 14:13:46,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:46,333 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-11 14:13:46,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:47,823 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-11 14:13:47,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:13:51,077 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-11 14:13:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:13:51,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-11 14:13:51,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:13:51,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 14:13:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 14:13:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 14:13:51,098 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-11 14:13:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:13:53,495 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-11 14:13:53,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 14:13:53,496 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-11 14:13:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:13:53,497 INFO L225 Difference]: With dead ends: 250 [2019-01-11 14:13:53,497 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 14:13:53,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 14:13:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 14:13:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-11 14:13:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-11 14:13:53,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-11 14:13:53,554 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-11 14:13:53,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:13:53,554 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-11 14:13:53,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 14:13:53,555 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-11 14:13:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-11 14:13:53,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:13:53,555 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-11 14:13:53,556 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:13:53,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:13:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-11 14:13:53,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:13:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:53,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:13:53,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:13:53,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:13:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:13:55,029 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-11 14:13:55,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:55,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:13:55,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:13:55,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:13:55,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:13:55,029 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-11 14:13:55,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:13:55,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:13:55,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:13:55,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:13:55,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:13:55,202 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-11 14:13:55,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:13:55,210 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-11 14:13:55,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:13:56,790 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-11 14:13:56,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:00,201 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-11 14:14:00,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:00,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-11 14:14:00,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:00,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 14:14:00,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 14:14:00,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 14:14:00,222 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-11 14:14:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:02,888 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-11 14:14:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 14:14:02,889 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-11 14:14:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:02,890 INFO L225 Difference]: With dead ends: 255 [2019-01-11 14:14:02,890 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 14:14:02,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 14:14:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 14:14:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-11 14:14:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-11 14:14:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-11 14:14:02,944 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-11 14:14:02,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:02,944 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-11 14:14:02,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 14:14:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-11 14:14:02,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-11 14:14:02,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:02,946 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-11 14:14:02,946 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:02,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:02,947 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-11 14:14:02,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:02,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:02,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:02,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:04,265 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-11 14:14:04,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:04,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:04,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:04,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:04,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:04,266 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-11 14:14:04,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:04,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:04,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:04,431 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-11 14:14:04,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:04,441 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-11 14:14:04,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:06,340 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-11 14:14:06,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:09,738 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-11 14:14:09,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:09,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-11 14:14:09,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:09,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 14:14:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 14:14:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 14:14:09,759 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-11 14:14:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:12,530 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-11 14:14:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 14:14:12,531 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-11 14:14:12,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:12,532 INFO L225 Difference]: With dead ends: 260 [2019-01-11 14:14:12,532 INFO L226 Difference]: Without dead ends: 259 [2019-01-11 14:14:12,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 14:14:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-11 14:14:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-11 14:14:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 14:14:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-11 14:14:12,589 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-11 14:14:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:12,589 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-11 14:14:12,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 14:14:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-11 14:14:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-11 14:14:12,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:12,591 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-11 14:14:12,591 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-11 14:14:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:12,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:12,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:14,008 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-11 14:14:14,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:14,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:14,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:14,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:14,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:14,009 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-11 14:14:14,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:14,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:14,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-11 14:14:14,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:14,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:14,368 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-11 14:14:14,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:14,376 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-11 14:14:14,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:16,350 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-11 14:14:16,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:19,667 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-11 14:14:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-11 14:14:19,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:19,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 14:14:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 14:14:19,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 14:14:19,691 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-11 14:14:22,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:22,562 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-11 14:14:22,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 14:14:22,562 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-11 14:14:22,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:22,563 INFO L225 Difference]: With dead ends: 265 [2019-01-11 14:14:22,563 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 14:14:22,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 14:14:22,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 14:14:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-11 14:14:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 14:14:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-11 14:14:22,617 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-11 14:14:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:22,617 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-11 14:14:22,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 14:14:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-11 14:14:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-11 14:14:22,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:22,619 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-11 14:14:22,619 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-11 14:14:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:22,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:22,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:22,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:22,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:24,050 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-11 14:14:24,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:24,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:24,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:24,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:24,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:24,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:14:24,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:14:24,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:14:24,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:14:24,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:24,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:24,231 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-11 14:14:24,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:24,249 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-11 14:14:24,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:26,237 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-11 14:14:26,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:29,694 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-11 14:14:29,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:29,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-11 14:14:29,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 14:14:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 14:14:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 14:14:29,716 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-11 14:14:32,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:32,774 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-11 14:14:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 14:14:32,774 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-11 14:14:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:32,775 INFO L225 Difference]: With dead ends: 270 [2019-01-11 14:14:32,775 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 14:14:32,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 14:14:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 14:14:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-11 14:14:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-11 14:14:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-11 14:14:32,835 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-11 14:14:32,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:32,835 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-11 14:14:32,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 14:14:32,835 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-11 14:14:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-11 14:14:32,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:32,836 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-11 14:14:32,837 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-11 14:14:32,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:32,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:32,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:32,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:34,256 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-11 14:14:34,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:34,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:34,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:34,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:34,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:34,256 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-11 14:14:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:34,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:14:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:34,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:34,438 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-11 14:14:34,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:34,446 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-11 14:14:34,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:36,539 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-11 14:14:36,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:39,943 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-11 14:14:39,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:39,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-11 14:14:39,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:39,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 14:14:39,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 14:14:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 14:14:39,965 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-11 14:14:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:42,866 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-11 14:14:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 14:14:42,866 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-11 14:14:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:42,867 INFO L225 Difference]: With dead ends: 275 [2019-01-11 14:14:42,867 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 14:14:42,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 14:14:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 14:14:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-11 14:14:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-11 14:14:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-11 14:14:42,919 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-11 14:14:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:42,919 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-11 14:14:42,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 14:14:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-11 14:14:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-11 14:14:42,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:42,921 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-11 14:14:42,921 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:42,921 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-11 14:14:42,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:14:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:42,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:44,575 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-11 14:14:44,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:44,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:44,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:44,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:44,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:44,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:14:44,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:14:44,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:14:44,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-11 14:14:44,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:44,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:44,960 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-11 14:14:44,960 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:44,968 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-11 14:14:44,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:47,156 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-11 14:14:47,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:14:50,640 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-11 14:14:50,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:14:50,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-11 14:14:50,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:14:50,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 14:14:50,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 14:14:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 14:14:50,662 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-11 14:14:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:14:53,878 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-11 14:14:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 14:14:53,878 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-11 14:14:53,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:14:53,879 INFO L225 Difference]: With dead ends: 280 [2019-01-11 14:14:53,879 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 14:14:53,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 14:14:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 14:14:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-11 14:14:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 14:14:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-11 14:14:53,937 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-11 14:14:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:14:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-11 14:14:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 14:14:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-11 14:14:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-11 14:14:53,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:14:53,939 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-11 14:14:53,940 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:14:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:14:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-11 14:14:53,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:14:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:53,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:14:53,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:14:53,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:14:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:14:55,534 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-11 14:14:55,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:55,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:14:55,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:14:55,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:14:55,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:14:55,535 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-11 14:14:55,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:14:55,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:14:55,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:14:55,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:14:55,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:14:55,731 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-11 14:14:55,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:14:55,739 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-11 14:14:55,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:14:57,926 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-11 14:14:57,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:01,505 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-11 14:15:01,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:01,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-11 14:15:01,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:01,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 14:15:01,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 14:15:01,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 14:15:01,526 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-11 14:15:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:04,586 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-11 14:15:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 14:15:04,587 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-11 14:15:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:04,588 INFO L225 Difference]: With dead ends: 285 [2019-01-11 14:15:04,588 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 14:15:04,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 14:15:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 14:15:04,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-11 14:15:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-11 14:15:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-11 14:15:04,643 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-11 14:15:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:04,643 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-11 14:15:04,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 14:15:04,643 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-11 14:15:04,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-11 14:15:04,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:04,644 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-11 14:15:04,644 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:15:04,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-11 14:15:04,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:04,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:04,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:04,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:06,283 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-11 14:15:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:06,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:06,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:06,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:06,284 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-11 14:15:06,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:06,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:06,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:06,474 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-11 14:15:06,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:06,482 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-11 14:15:06,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:15:08,664 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-11 14:15:08,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:12,594 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-11 14:15:12,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:12,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-11 14:15:12,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:12,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-11 14:15:12,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-11 14:15:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 14:15:12,618 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-11 14:15:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:15,762 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-11 14:15:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 14:15:15,762 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-11 14:15:15,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:15,763 INFO L225 Difference]: With dead ends: 290 [2019-01-11 14:15:15,763 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 14:15:15,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 14:15:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 14:15:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-11 14:15:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-11 14:15:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-11 14:15:15,823 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-11 14:15:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:15,823 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-11 14:15:15,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-11 14:15:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-11 14:15:15,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-11 14:15:15,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:15,824 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-11 14:15:15,824 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:15:15,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:15,825 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-11 14:15:15,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:15,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:15,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:17,748 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-11 14:15:17,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:17,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:17,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:17,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:17,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:17,748 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-11 14:15:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:15:17,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:15:18,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-11 14:15:18,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:18,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:18,203 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-11 14:15:18,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:18,213 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-11 14:15:18,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:15:20,243 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-11 14:15:20,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:24,101 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-11 14:15:24,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:24,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-11 14:15:24,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:24,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 14:15:24,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 14:15:24,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 14:15:24,123 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-11 14:15:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:27,660 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-11 14:15:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 14:15:27,661 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-11 14:15:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:27,662 INFO L225 Difference]: With dead ends: 295 [2019-01-11 14:15:27,662 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 14:15:27,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 14:15:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 14:15:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-11 14:15:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-11 14:15:27,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-11 14:15:27,728 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-11 14:15:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-11 14:15:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 14:15:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-11 14:15:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-11 14:15:27,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:27,730 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-11 14:15:27,730 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:15:27,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:27,730 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-11 14:15:27,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:27,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:27,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:29,522 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-11 14:15:29,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:29,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:29,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:29,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:29,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:29,523 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-11 14:15:29,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:15:29,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:15:29,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:15:29,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:29,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:29,729 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-11 14:15:29,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:29,738 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-11 14:15:29,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:15:31,836 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-11 14:15:31,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:35,783 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-11 14:15:35,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-11 14:15:35,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:35,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-11 14:15:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-11 14:15:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 14:15:35,804 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-11 14:15:39,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:39,298 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-11 14:15:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 14:15:39,298 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-11 14:15:39,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:39,299 INFO L225 Difference]: With dead ends: 300 [2019-01-11 14:15:39,299 INFO L226 Difference]: Without dead ends: 299 [2019-01-11 14:15:39,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 14:15:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-11 14:15:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-11 14:15:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 14:15:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-11 14:15:39,370 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-11 14:15:39,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:39,371 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-11 14:15:39,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-11 14:15:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-11 14:15:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-11 14:15:39,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:39,372 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-11 14:15:39,373 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:15:39,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:39,373 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-11 14:15:39,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:39,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:15:39,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:39,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:41,217 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-11 14:15:41,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:41,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:41,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:41,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:41,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:41,218 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-11 14:15:41,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:41,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:15:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:41,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:41,413 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-11 14:15:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:41,426 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-11 14:15:41,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:15:43,712 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-11 14:15:43,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:15:47,546 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-11 14:15:47,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:15:47,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-11 14:15:47,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:15:47,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-11 14:15:47,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-11 14:15:47,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 14:15:47,567 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-11 14:15:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:15:51,136 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-11 14:15:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 14:15:51,136 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-11 14:15:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:15:51,137 INFO L225 Difference]: With dead ends: 305 [2019-01-11 14:15:51,137 INFO L226 Difference]: Without dead ends: 304 [2019-01-11 14:15:51,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 14:15:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-11 14:15:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-11 14:15:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-11 14:15:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-11 14:15:51,201 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-11 14:15:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:15:51,201 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-11 14:15:51,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-11 14:15:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-11 14:15:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-11 14:15:51,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:15:51,202 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-11 14:15:51,203 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:15:51,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:15:51,203 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-11 14:15:51,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:15:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:15:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:15:51,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:15:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:15:53,255 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-11 14:15:53,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:53,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:15:53,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:15:53,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:15:53,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:15:53,256 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-11 14:15:53,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:15:53,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:15:53,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-11 14:15:53,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:15:53,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:15:53,713 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-11 14:15:53,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:15:53,723 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-11 14:15:53,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:15:55,998 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-11 14:15:55,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:00,045 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-11 14:16:00,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:00,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-11 14:16:00,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:00,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 14:16:00,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 14:16:00,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 14:16:00,067 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-11 14:16:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:03,745 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-11 14:16:03,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 14:16:03,746 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-11 14:16:03,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:03,747 INFO L225 Difference]: With dead ends: 310 [2019-01-11 14:16:03,747 INFO L226 Difference]: Without dead ends: 309 [2019-01-11 14:16:03,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-11 14:16:03,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-11 14:16:03,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-11 14:16:03,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-11 14:16:03,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-11 14:16:03,814 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-11 14:16:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:03,814 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-11 14:16:03,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 14:16:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-11 14:16:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 14:16:03,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:03,815 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-11 14:16:03,815 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:16:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:03,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-11 14:16:03,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:03,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:03,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:03,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:05,633 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-11 14:16:05,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:05,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:05,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:05,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:05,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:05,634 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-11 14:16:05,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:16:05,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:16:05,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:16:05,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:05,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:05,842 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-11 14:16:05,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:05,849 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-11 14:16:05,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:16:08,363 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-11 14:16:08,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:12,208 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-11 14:16:12,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:12,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-11 14:16:12,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:12,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-11 14:16:12,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-11 14:16:12,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 14:16:12,230 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-11 14:16:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:16,063 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-11 14:16:16,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 14:16:16,063 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-11 14:16:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:16,064 INFO L225 Difference]: With dead ends: 315 [2019-01-11 14:16:16,064 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 14:16:16,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-11 14:16:16,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 14:16:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-11 14:16:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-11 14:16:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-11 14:16:16,148 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-11 14:16:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:16,148 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-11 14:16:16,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-11 14:16:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-11 14:16:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-11 14:16:16,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:16,149 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-11 14:16:16,149 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:16:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-11 14:16:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:16,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:16,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:16,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:16,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:18,102 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-11 14:16:18,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:18,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:18,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:18,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:18,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:18,103 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-11 14:16:18,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:18,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:18,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:18,314 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-11 14:16:18,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:18,322 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-11 14:16:18,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:16:20,777 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-11 14:16:20,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:25,223 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-11 14:16:25,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:25,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-11 14:16:25,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:25,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-11 14:16:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-11 14:16:25,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 14:16:25,244 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-11 14:16:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:29,216 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-11 14:16:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 14:16:29,217 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-11 14:16:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:29,218 INFO L225 Difference]: With dead ends: 320 [2019-01-11 14:16:29,218 INFO L226 Difference]: Without dead ends: 319 [2019-01-11 14:16:29,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-11 14:16:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-11 14:16:29,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-11 14:16:29,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-11 14:16:29,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-11 14:16:29,288 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-11 14:16:29,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:29,288 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-11 14:16:29,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-11 14:16:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-11 14:16:29,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-11 14:16:29,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:29,290 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-11 14:16:29,290 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:16:29,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:29,290 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-11 14:16:29,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:29,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:29,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:29,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:31,383 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-11 14:16:31,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:31,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:31,383 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:31,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:31,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:31,383 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-11 14:16:31,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:16:31,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:16:31,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-11 14:16:31,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:31,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:31,881 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-11 14:16:31,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:31,894 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-11 14:16:31,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:16:34,590 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-11 14:16:34,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:38,431 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-11 14:16:38,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:38,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-11 14:16:38,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:38,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 14:16:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 14:16:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 14:16:38,453 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-11 14:16:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:42,421 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-11 14:16:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 14:16:42,422 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-11 14:16:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:42,423 INFO L225 Difference]: With dead ends: 325 [2019-01-11 14:16:42,423 INFO L226 Difference]: Without dead ends: 324 [2019-01-11 14:16:42,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-11 14:16:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-11 14:16:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-11 14:16:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-11 14:16:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-11 14:16:42,497 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-11 14:16:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:42,497 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-11 14:16:42,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 14:16:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-11 14:16:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-11 14:16:42,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:42,499 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-11 14:16:42,499 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:16:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-11 14:16:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:42,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:42,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:44,912 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-11 14:16:44,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:44,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:44,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:44,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:44,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:44,913 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-11 14:16:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:16:44,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:16:45,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:16:45,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:16:45,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:45,134 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-11 14:16:45,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:45,143 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-11 14:16:45,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:16:47,728 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-11 14:16:47,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:16:51,898 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-11 14:16:51,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:16:51,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-11 14:16:51,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:16:51,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-11 14:16:51,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-11 14:16:51,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 14:16:51,921 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-11 14:16:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:16:56,153 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-11 14:16:56,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 14:16:56,154 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-11 14:16:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:16:56,155 INFO L225 Difference]: With dead ends: 330 [2019-01-11 14:16:56,155 INFO L226 Difference]: Without dead ends: 329 [2019-01-11 14:16:56,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-11 14:16:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-11 14:16:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-11 14:16:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-11 14:16:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-11 14:16:56,233 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-11 14:16:56,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:16:56,234 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-11 14:16:56,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-11 14:16:56,234 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-11 14:16:56,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-11 14:16:56,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:16:56,235 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-11 14:16:56,235 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:16:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:16:56,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-11 14:16:56,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:16:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:56,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:16:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:16:56,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:16:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:58,418 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-11 14:16:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:58,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:16:58,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:16:58,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:16:58,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:16:58,418 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-11 14:16:58,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:16:58,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:16:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:16:58,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:16:58,633 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-11 14:16:58,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:16:58,647 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-11 14:16:58,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:17:01,578 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-11 14:17:01,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:05,675 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-11 14:17:05,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:05,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-11 14:17:05,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:05,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-11 14:17:05,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-11 14:17:05,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 14:17:05,697 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-11 14:17:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:10,021 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-11 14:17:10,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 14:17:10,021 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-11 14:17:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:10,023 INFO L225 Difference]: With dead ends: 335 [2019-01-11 14:17:10,023 INFO L226 Difference]: Without dead ends: 334 [2019-01-11 14:17:10,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-11 14:17:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-11 14:17:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-11 14:17:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-11 14:17:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-11 14:17:10,103 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-11 14:17:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:10,103 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-11 14:17:10,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-11 14:17:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-11 14:17:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-11 14:17:10,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:10,104 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-11 14:17:10,104 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:17:10,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-11 14:17:10,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:10,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:17:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:10,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:12,316 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-11 14:17:12,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:12,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:12,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:12,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:12,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:12,316 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-11 14:17:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:17:12,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:17:12,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-11 14:17:12,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:12,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:12,840 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-11 14:17:12,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:12,852 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-11 14:17:12,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:17:15,661 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-11 14:17:15,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:19,573 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-11 14:17:19,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-11 14:17:19,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 14:17:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 14:17:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 14:17:19,596 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-11 14:17:23,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:23,909 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-11 14:17:23,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 14:17:23,910 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-11 14:17:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:23,911 INFO L225 Difference]: With dead ends: 340 [2019-01-11 14:17:23,911 INFO L226 Difference]: Without dead ends: 339 [2019-01-11 14:17:23,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-11 14:17:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-11 14:17:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-11 14:17:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 14:17:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-11 14:17:24,024 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-11 14:17:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:24,024 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-11 14:17:24,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 14:17:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-11 14:17:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-11 14:17:24,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:24,026 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-11 14:17:24,026 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:17:24,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-11 14:17:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:24,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:24,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:26,479 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-11 14:17:26,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:26,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:26,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:26,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:26,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:26,480 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-11 14:17:26,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:17:26,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:17:26,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:17:26,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:26,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:26,713 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-11 14:17:26,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:26,724 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-11 14:17:26,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:17:29,502 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-11 14:17:29,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:33,693 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-11 14:17:33,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:33,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-11 14:17:33,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:33,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-11 14:17:33,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-11 14:17:33,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 14:17:33,715 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-11 14:17:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:38,154 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-11 14:17:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 14:17:38,154 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-11 14:17:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:38,155 INFO L225 Difference]: With dead ends: 345 [2019-01-11 14:17:38,155 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 14:17:38,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-11 14:17:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 14:17:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-11 14:17:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 14:17:38,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-11 14:17:38,240 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-11 14:17:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:38,240 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-11 14:17:38,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-11 14:17:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-11 14:17:38,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-11 14:17:38,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:38,242 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-11 14:17:38,242 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:17:38,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-11 14:17:38,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:38,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:38,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:17:38,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:38,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:40,886 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-11 14:17:40,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:40,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:40,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:40,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:40,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:40,887 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-11 14:17:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:17:40,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:17:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:41,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:41,106 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-11 14:17:41,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:41,115 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-11 14:17:41,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:17:43,898 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-11 14:17:43,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:17:48,244 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-11 14:17:48,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:17:48,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-11 14:17:48,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:17:48,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-11 14:17:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-11 14:17:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 14:17:48,266 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-11 14:17:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:17:52,879 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-11 14:17:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 14:17:52,880 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-11 14:17:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:17:52,881 INFO L225 Difference]: With dead ends: 350 [2019-01-11 14:17:52,881 INFO L226 Difference]: Without dead ends: 349 [2019-01-11 14:17:52,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-11 14:17:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-11 14:17:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-11 14:17:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-11 14:17:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-11 14:17:52,984 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-11 14:17:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:17:52,984 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-11 14:17:52,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-11 14:17:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-11 14:17:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-11 14:17:52,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:17:52,985 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-11 14:17:52,986 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:17:52,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:17:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-11 14:17:52,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:17:52,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:52,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:17:52,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:17:52,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:17:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:17:55,319 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-11 14:17:55,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:55,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:17:55,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:17:55,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:17:55,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:17:55,319 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-11 14:17:55,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:17:55,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:17:55,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-11 14:17:55,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:17:55,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:17:55,907 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-11 14:17:55,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:17:55,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-11 14:17:55,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:17:58,876 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-11 14:17:58,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:03,156 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-11 14:18:03,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:03,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-11 14:18:03,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:03,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 14:18:03,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 14:18:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 14:18:03,180 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-11 14:18:07,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:07,709 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-11 14:18:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 14:18:07,709 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-11 14:18:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:07,710 INFO L225 Difference]: With dead ends: 355 [2019-01-11 14:18:07,710 INFO L226 Difference]: Without dead ends: 354 [2019-01-11 14:18:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-11 14:18:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-11 14:18:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-11 14:18:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-11 14:18:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-11 14:18:07,799 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-11 14:18:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:07,800 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-11 14:18:07,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 14:18:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-11 14:18:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-11 14:18:07,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:07,801 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-11 14:18:07,801 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:18:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:07,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-11 14:18:07,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:07,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:07,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:10,197 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-11 14:18:10,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:10,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:10,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:10,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:10,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:10,197 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-11 14:18:10,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:18:10,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:18:10,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:18:10,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:10,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:10,455 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-11 14:18:10,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:18:10,554 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-11 14:18:10,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:18:13,911 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-11 14:18:13,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:18,339 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-11 14:18:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:18,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-11 14:18:18,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:18,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-11 14:18:18,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-11 14:18:18,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 14:18:18,362 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-11 14:18:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:23,340 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-11 14:18:23,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 14:18:23,341 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-11 14:18:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:23,342 INFO L225 Difference]: With dead ends: 360 [2019-01-11 14:18:23,342 INFO L226 Difference]: Without dead ends: 359 [2019-01-11 14:18:23,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-11 14:18:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-11 14:18:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-11 14:18:23,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 14:18:23,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-11 14:18:23,434 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-11 14:18:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:23,434 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-11 14:18:23,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-11 14:18:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-11 14:18:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-11 14:18:23,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:23,436 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-11 14:18:23,436 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:18:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-11 14:18:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:23,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:23,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:25,930 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-11 14:18:25,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:25,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:25,931 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:25,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:25,931 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-11 14:18:25,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:25,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:18:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:26,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:26,160 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-11 14:18:26,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:18:26,171 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-11 14:18:26,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:18:29,351 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-11 14:18:29,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:33,688 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-11 14:18:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:33,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-11 14:18:33,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:33,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-11 14:18:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-11 14:18:33,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 14:18:33,710 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-11 14:18:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:38,655 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-11 14:18:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 14:18:38,655 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-11 14:18:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:38,657 INFO L225 Difference]: With dead ends: 365 [2019-01-11 14:18:38,657 INFO L226 Difference]: Without dead ends: 364 [2019-01-11 14:18:38,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-11 14:18:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-11 14:18:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-11 14:18:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 14:18:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-11 14:18:38,753 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-11 14:18:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:38,753 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-11 14:18:38,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-11 14:18:38,753 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-11 14:18:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-11 14:18:38,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:38,754 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-11 14:18:38,755 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:18:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-11 14:18:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:18:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:38,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:41,335 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-11 14:18:41,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:41,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:41,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:41,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:41,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:41,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 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-11 14:18:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:18:41,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:18:41,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-11 14:18:41,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:41,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:41,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:18:41,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:18:41,976 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-11 14:18:41,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:18:45,127 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-11 14:18:45,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:18:49,443 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-11 14:18:49,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:18:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-11 14:18:49,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:18:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 14:18:49,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 14:18:49,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 14:18:49,466 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-11 14:18:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:18:54,535 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-11 14:18:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 14:18:54,535 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-11 14:18:54,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:18:54,536 INFO L225 Difference]: With dead ends: 370 [2019-01-11 14:18:54,536 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 14:18:54,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-11 14:18:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 14:18:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-11 14:18:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 14:18:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-11 14:18:54,635 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-11 14:18:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:18:54,636 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-11 14:18:54,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 14:18:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-11 14:18:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-11 14:18:54,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:18:54,637 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-11 14:18:54,637 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:18:54,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:18:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-11 14:18:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:18:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:54,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:18:54,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:18:54,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:18:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:18:57,598 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-11 14:18:57,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:57,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:18:57,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:18:57,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:18:57,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:18:57,599 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-11 14:18:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:18:57,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:18:57,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:18:57,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:18:57,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:18:57,848 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-11 14:18:57,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:18:57,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-11 14:18:57,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:19:00,986 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-11 14:19:00,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:05,282 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-11 14:19:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:05,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-11 14:19:05,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:05,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-11 14:19:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-11 14:19:05,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 14:19:05,305 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-11 14:19:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:10,383 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-11 14:19:10,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 14:19:10,383 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-11 14:19:10,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:10,384 INFO L225 Difference]: With dead ends: 375 [2019-01-11 14:19:10,385 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 14:19:10,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-11 14:19:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 14:19:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-11 14:19:10,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-11 14:19:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-11 14:19:10,485 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-11 14:19:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:10,486 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-11 14:19:10,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-11 14:19:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-11 14:19:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-11 14:19:10,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:10,487 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-11 14:19:10,487 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:19:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:10,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-11 14:19:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:10,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:10,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:10,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:13,376 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-11 14:19:13,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:13,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:13,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:13,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:13,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:13,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:19:13,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:13,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:19:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:13,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:13,621 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-11 14:19:13,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:13,633 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-11 14:19:13,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:19:16,963 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-11 14:19:16,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:21,289 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-11 14:19:21,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:21,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-11 14:19:21,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:21,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-11 14:19:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-11 14:19:21,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 14:19:21,311 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-11 14:19:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:26,587 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-11 14:19:26,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 14:19:26,587 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-11 14:19:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:26,589 INFO L225 Difference]: With dead ends: 380 [2019-01-11 14:19:26,589 INFO L226 Difference]: Without dead ends: 379 [2019-01-11 14:19:26,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-11 14:19:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-11 14:19:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-11 14:19:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-11 14:19:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-11 14:19:26,695 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-11 14:19:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:26,695 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-11 14:19:26,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-11 14:19:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-11 14:19:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-11 14:19:26,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:26,697 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-11 14:19:26,697 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:19:26,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-11 14:19:26,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:19:26,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:26,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:29,610 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-11 14:19:29,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:29,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:29,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:29,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:29,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:29,610 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-11 14:19:29,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:19:29,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:19:30,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-11 14:19:30,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:30,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:30,275 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-11 14:19:30,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:30,284 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-11 14:19:30,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:19:33,911 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-11 14:19:33,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:38,421 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-11 14:19:38,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:38,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-11 14:19:38,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:38,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 14:19:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 14:19:38,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 14:19:38,444 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-11 14:19:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:19:43,761 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-11 14:19:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 14:19:43,762 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-11 14:19:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:19:43,763 INFO L225 Difference]: With dead ends: 385 [2019-01-11 14:19:43,763 INFO L226 Difference]: Without dead ends: 384 [2019-01-11 14:19:43,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-11 14:19:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-11 14:19:43,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-11 14:19:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-11 14:19:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-11 14:19:43,872 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-11 14:19:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:19:43,872 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-11 14:19:43,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 14:19:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-11 14:19:43,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-11 14:19:43,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:19:43,874 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-11 14:19:43,874 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:19:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:19:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-11 14:19:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:19:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:43,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:19:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:19:43,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:19:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:19:46,729 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-11 14:19:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:46,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:19:46,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:19:46,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:19:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:19:46,730 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-11 14:19:46,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:19:46,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:19:46,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:19:46,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:19:47,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:19:47,012 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-11 14:19:47,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:19:47,024 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-11 14:19:47,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:19:50,775 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-11 14:19:50,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:19:55,298 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-11 14:19:55,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:19:55,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-11 14:19:55,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:19:55,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-11 14:19:55,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-11 14:19:55,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 14:19:55,320 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-11 14:20:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:00,716 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-11 14:20:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 14:20:00,716 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-11 14:20:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:00,717 INFO L225 Difference]: With dead ends: 390 [2019-01-11 14:20:00,717 INFO L226 Difference]: Without dead ends: 389 [2019-01-11 14:20:00,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-11 14:20:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-11 14:20:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-11 14:20:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-11 14:20:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-11 14:20:00,827 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-11 14:20:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:00,828 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-11 14:20:00,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-11 14:20:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-11 14:20:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-11 14:20:00,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:00,829 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-11 14:20:00,829 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:20:00,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-11 14:20:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:00,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:00,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:00,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:04,081 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-11 14:20:04,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:04,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:04,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:04,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:04,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:04,081 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-11 14:20:04,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:04,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:04,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:04,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:04,329 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-11 14:20:04,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:04,340 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-11 14:20:04,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:20:07,847 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-11 14:20:07,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:12,333 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-11 14:20:12,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:12,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-11 14:20:12,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:12,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-11 14:20:12,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-11 14:20:12,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 14:20:12,356 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-11 14:20:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:18,073 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-11 14:20:18,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 14:20:18,074 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-11 14:20:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:18,075 INFO L225 Difference]: With dead ends: 395 [2019-01-11 14:20:18,075 INFO L226 Difference]: Without dead ends: 394 [2019-01-11 14:20:18,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-11 14:20:18,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-11 14:20:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-11 14:20:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-11 14:20:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-11 14:20:18,191 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-11 14:20:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:18,191 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-11 14:20:18,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-11 14:20:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-11 14:20:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-11 14:20:18,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:18,193 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-11 14:20:18,193 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:20:18,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-11 14:20:18,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:18,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:18,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:18,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:18,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:21,307 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-11 14:20:21,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:21,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:21,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:21,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:21,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:21,308 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-11 14:20:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:20:21,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:20:21,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-11 14:20:21,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:22,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:22,005 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-11 14:20:22,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:22,016 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-11 14:20:22,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:20:25,897 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-11 14:20:25,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:30,601 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-11 14:20:30,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:30,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-11 14:20:30,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:30,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 14:20:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 14:20:30,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-11 14:20:30,624 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-11 14:20:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:36,460 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-11 14:20:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 14:20:36,460 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-11 14:20:36,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:36,462 INFO L225 Difference]: With dead ends: 400 [2019-01-11 14:20:36,462 INFO L226 Difference]: Without dead ends: 399 [2019-01-11 14:20:36,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-11 14:20:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-11 14:20:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-11 14:20:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-11 14:20:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-11 14:20:36,580 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-11 14:20:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:36,581 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-11 14:20:36,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 14:20:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-11 14:20:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-11 14:20:36,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:36,582 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-11 14:20:36,582 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:20:36,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:36,583 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-11 14:20:36,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:36,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:36,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:40,051 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-11 14:20:40,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:40,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:40,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:40,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:40,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:40,052 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-11 14:20:40,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:20:40,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:20:40,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:20:40,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:20:40,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:40,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11 14:20:40,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:40,347 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-11 14:20:40,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:20:44,068 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-11 14:20:44,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:20:48,419 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-11 14:20:48,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:20:48,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-11 14:20:48,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:20:48,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-11 14:20:48,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-11 14:20:48,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 14:20:48,441 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-11 14:20:54,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:20:54,227 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-11 14:20:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 14:20:54,227 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-11 14:20:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:20:54,228 INFO L225 Difference]: With dead ends: 405 [2019-01-11 14:20:54,229 INFO L226 Difference]: Without dead ends: 404 [2019-01-11 14:20:54,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-11 14:20:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-11 14:20:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-11 14:20:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-11 14:20:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-11 14:20:54,345 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-11 14:20:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:20:54,345 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-11 14:20:54,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-11 14:20:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-11 14:20:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-11 14:20:54,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:20:54,347 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-11 14:20:54,347 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:20:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:20:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-11 14:20:54,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:20:54,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:20:54,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:20:54,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:20:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:57,734 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-11 14:20:57,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:57,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:20:57,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:20:57,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:20:57,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:20:57,735 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-11 14:20:57,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:20:57,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:20:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:20:57,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:20:57,998 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-11 14:20:57,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:20:58,008 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-11 14:20:58,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:21:02,018 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-11 14:21:02,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:06,396 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-11 14:21:06,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-11 14:21:06,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-11 14:21:06,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-11 14:21:06,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 14:21:06,419 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-11 14:21:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:12,353 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-11 14:21:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 14:21:12,353 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-11 14:21:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:12,354 INFO L225 Difference]: With dead ends: 410 [2019-01-11 14:21:12,355 INFO L226 Difference]: Without dead ends: 409 [2019-01-11 14:21:12,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-11 14:21:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-11 14:21:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-11 14:21:12,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-11 14:21:12,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-11 14:21:12,476 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-11 14:21:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:12,476 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-11 14:21:12,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-11 14:21:12,476 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-11 14:21:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-11 14:21:12,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:12,478 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-11 14:21:12,478 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:21:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:12,478 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-11 14:21:12,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:12,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:12,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:12,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:16,004 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-11 14:21:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:16,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:16,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:16,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:16,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:16,005 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-11 14:21:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:21:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:21:16,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-11 14:21:16,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:16,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:16,785 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-11 14:21:16,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:16,794 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-11 14:21:16,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:21:20,966 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-11 14:21:20,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:25,385 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-11 14:21:25,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-11 14:21:25,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:25,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 14:21:25,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 14:21:25,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 14:21:25,409 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-11 14:21:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:31,897 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-11 14:21:31,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 14:21:31,898 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-11 14:21:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:31,899 INFO L225 Difference]: With dead ends: 415 [2019-01-11 14:21:31,899 INFO L226 Difference]: Without dead ends: 414 [2019-01-11 14:21:31,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-11 14:21:31,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-11 14:21:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-11 14:21:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-11 14:21:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-11 14:21:32,027 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-11 14:21:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:32,027 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-11 14:21:32,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-11 14:21:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-11 14:21:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-11 14:21:32,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:32,028 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-11 14:21:32,029 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:21:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-11 14:21:32,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:32,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:32,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:32,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:32,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:35,265 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-11 14:21:35,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:35,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:35,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:35,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:35,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:35,266 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-11 14:21:35,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:21:35,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:21:35,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:21:35,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:21:35,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:35,557 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-11 14:21:35,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:35,566 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-11 14:21:35,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:21:39,747 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-11 14:21:39,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:21:44,487 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-11 14:21:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:21:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-11 14:21:44,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:21:44,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-11 14:21:44,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-11 14:21:44,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-11 14:21:44,509 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-11 14:21:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:21:50,846 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-11 14:21:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 14:21:50,846 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-11 14:21:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:21:50,848 INFO L225 Difference]: With dead ends: 420 [2019-01-11 14:21:50,848 INFO L226 Difference]: Without dead ends: 419 [2019-01-11 14:21:50,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-11 14:21:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-11 14:21:50,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-11 14:21:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-11 14:21:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-11 14:21:50,979 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-11 14:21:50,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:21:50,979 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-11 14:21:50,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-11 14:21:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-11 14:21:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-11 14:21:50,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:21:50,981 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-11 14:21:50,981 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:21:50,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:21:50,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-11 14:21:50,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:21:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:50,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:21:50,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:21:50,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:21:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:54,393 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-11 14:21:54,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:54,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:21:54,393 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:21:54,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:21:54,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:21:54,393 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-11 14:21:54,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:21:54,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:21:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:21:54,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:21:54,666 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-11 14:21:54,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:21:54,677 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-11 14:21:54,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:21:58,938 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-11 14:21:58,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:03,593 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-11 14:22:03,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:03,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-11 14:22:03,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:03,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-11 14:22:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-11 14:22:03,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 14:22:03,615 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-11 14:22:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:10,053 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-11 14:22:10,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 14:22:10,053 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-11 14:22:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:10,055 INFO L225 Difference]: With dead ends: 425 [2019-01-11 14:22:10,055 INFO L226 Difference]: Without dead ends: 424 [2019-01-11 14:22:10,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-11 14:22:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-11 14:22:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-11 14:22:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-11 14:22:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-11 14:22:10,185 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-11 14:22:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:10,185 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-11 14:22:10,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-11 14:22:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-11 14:22:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-11 14:22:10,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:10,187 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-11 14:22:10,188 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:22:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-11 14:22:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:10,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:10,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:10,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:14,087 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-11 14:22:14,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:14,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:14,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:14,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:14,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:14,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:22:14,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:22:14,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:22:14,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-11 14:22:14,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:14,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:14,912 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-11 14:22:14,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:14,924 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-11 14:22:14,924 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:22:19,242 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-11 14:22:19,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:23,959 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-11 14:22:23,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:23,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-11 14:22:23,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:23,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-11 14:22:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-11 14:22:23,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 14:22:23,985 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-01-11 14:22:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:30,664 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-01-11 14:22:30,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 14:22:30,665 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-01-11 14:22:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:30,666 INFO L225 Difference]: With dead ends: 430 [2019-01-11 14:22:30,666 INFO L226 Difference]: Without dead ends: 429 [2019-01-11 14:22:30,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-01-11 14:22:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-01-11 14:22:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-01-11 14:22:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-11 14:22:30,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-01-11 14:22:30,804 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-01-11 14:22:30,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:30,805 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-01-11 14:22:30,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-11 14:22:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-01-11 14:22:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-01-11 14:22:30,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:30,807 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-01-11 14:22:30,807 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:22:30,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:30,807 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-01-11 14:22:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:30,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:30,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:30,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:34,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:34,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:34,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:34,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:34,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:34,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:34,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:22:34,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:22:34,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:22:34,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:22:34,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:34,813 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-11 14:22:34,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:34,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-11 14:22:34,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:22:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:39,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:22:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:44,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:22:44,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-11 14:22:44,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:22:44,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-11 14:22:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-11 14:22:44,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 14:22:44,043 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-01-11 14:22:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:22:50,728 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-01-11 14:22:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 14:22:50,729 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-01-11 14:22:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:22:50,730 INFO L225 Difference]: With dead ends: 435 [2019-01-11 14:22:50,731 INFO L226 Difference]: Without dead ends: 434 [2019-01-11 14:22:50,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-01-11 14:22:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-11 14:22:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-01-11 14:22:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-11 14:22:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-01-11 14:22:50,878 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-01-11 14:22:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:22:50,878 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-01-11 14:22:50,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-11 14:22:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-01-11 14:22:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-11 14:22:50,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:22:50,880 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-01-11 14:22:50,880 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:22:50,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:22:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-01-11 14:22:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:22:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:22:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:22:50,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:22:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:54,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:22:54,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:22:54,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:22:54,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:22:54,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:22:54,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:22:54,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:22:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:22:54,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:22:54,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-11 14:22:54,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:22:54,993 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-11 14:22:54,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:22:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:22:59,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:04,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:04,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-11 14:23:04,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:04,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-11 14:23:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-11 14:23:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13931, Invalid=22359, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 14:23:04,344 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-01-11 14:23:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:11,123 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-01-11 14:23:11,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 14:23:11,123 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-01-11 14:23:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:11,125 INFO L225 Difference]: With dead ends: 440 [2019-01-11 14:23:11,125 INFO L226 Difference]: Without dead ends: 439 [2019-01-11 14:23:11,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 684 SyntacticMatches, 72 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35812 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=26891, Invalid=50115, Unknown=0, NotChecked=0, Total=77006 [2019-01-11 14:23:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-11 14:23:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-01-11 14:23:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-01-11 14:23:11,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-01-11 14:23:11,270 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-01-11 14:23:11,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:11,270 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-01-11 14:23:11,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-11 14:23:11,270 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-01-11 14:23:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-01-11 14:23:11,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:11,272 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-01-11 14:23:11,272 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 14:23:11,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-01-11 14:23:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:11,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:11,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:15,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:15,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:15,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:15,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:15,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:15,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:16,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-11 14:23:16,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:16,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:16,194 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-11 14:23:16,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,204 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-11 14:23:16,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 14:23:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:20,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:25,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:25,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:25,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-11 14:23:25,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:25,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-11 14:23:25,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-11 14:23:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14033, Invalid=22639, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 14:23:25,601 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 178 states.