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-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:37,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:37,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:37,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:37,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:37,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:37,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:37,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:37,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:37,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:37,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:37,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:37,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:37,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:37,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:37,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:37,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:37,673 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:37,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:37,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:37,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:37,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:37,692 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:37,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:37,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:37,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:37,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:37,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:37,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:37,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:37,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:37,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:37,703 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:37,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:37,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:37,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:37,705 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-20 09:57:37,726 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:37,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:37,728 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:37,728 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:37,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:37,728 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:37,728 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:37,729 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:37,729 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:37,729 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:37,729 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:37,729 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:37,729 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:37,730 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:37,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:37,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:37,731 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:37,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:37,731 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:37,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:37,732 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:37,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:37,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:37,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:37,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:37,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:37,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:37,734 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:37,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:37,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:37,734 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:37,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:37,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:37,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:37,735 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:37,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:37,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:37,780 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:37,781 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:37,782 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:37,783 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-01-20 09:57:37,783 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-01-20 09:57:37,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:37,823 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:37,823 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:37,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:37,824 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:37,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,867 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-20 09:57:37,867 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-20 09:57:37,867 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-20 09:57:37,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:37,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:37,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:37,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:37,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:37,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:37,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:37,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:37,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57: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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:37,984 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-20 09:57:37,985 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-20 09:57:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-20 09:57:38,300 INFO L278 CfgBuilder]: Using library mode [2019-01-20 09:57:38,300 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-20 09:57:38,302 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:38 BoogieIcfgContainer [2019-01-20 09:57:38,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:38,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:38,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:38,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:38,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/2) ... [2019-01-20 09:57:38,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c828ff6 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:38, skipping insertion in model container [2019-01-20 09:57:38,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:38" (2/2) ... [2019-01-20 09:57:38,316 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-01-20 09:57:38,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:38,357 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:38,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:38,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:38,449 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:38,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:38,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:38,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:38,449 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:38,449 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:38,449 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-01-20 09:57:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:38,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:38,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-20 09:57:38,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,670 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-20 09:57:38,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:38,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 09:57:38,673 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:38,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:38,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:38,691 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-20 09:57:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,754 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-20 09:57:38,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:38,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 09:57:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,768 INFO L225 Difference]: With dead ends: 17 [2019-01-20 09:57:38,768 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 09:57:38,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 09:57:38,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-20 09:57:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 09:57:38,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-01-20 09:57:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,801 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 09:57:38,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:38,801 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 09:57:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:38,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 09:57:38,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-01-20 09:57:38,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,901 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 09:57:38,904 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-01-20 09:57:38,938 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:38,938 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:39,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:39,094 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 5 different actions 10 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-20 09:57:39,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:39,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,105 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-20 09:57:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:39,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,267 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-20 09:57:39,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,375 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-20 09:57:39,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 09:57:39,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 09:57:39,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 09:57:39,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:39,562 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-01-20 09:57:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:39,677 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-20 09:57:39,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:39,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-20 09:57:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:39,679 INFO L225 Difference]: With dead ends: 15 [2019-01-20 09:57:39,679 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 09:57:39,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:39,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 09:57:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-20 09:57:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 09:57:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-20 09:57:39,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-01-20 09:57:39,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:39,684 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-20 09:57:39,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 09:57:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-20 09:57:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 09:57:39,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:39,685 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-01-20 09:57:39,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-01-20 09:57:39,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:39,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,955 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-20 09:57:39,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:39,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:40,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 09:57:40,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:40,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,046 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-20 09:57:40,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:40,152 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-20 09:57:40,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:40,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:40,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 09:57:40,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:40,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:40,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:40,430 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-01-20 09:57:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:40,593 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-20 09:57:40,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:40,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-20 09:57:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:40,595 INFO L225 Difference]: With dead ends: 19 [2019-01-20 09:57:40,595 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 09:57:40,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 09:57:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-20 09:57:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-20 09:57:40,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-01-20 09:57:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:40,602 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-20 09:57:40,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:40,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-20 09:57:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:40,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:40,603 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-01-20 09:57:40,603 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:40,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:40,604 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-01-20 09:57:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:40,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,724 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-20 09:57:40,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:40,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:40,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:40,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:40,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,783 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-20 09:57:40,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:40,798 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-20 09:57:40,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 09:57:41,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:41,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:41,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:41,020 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-20 09:57:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,101 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-20 09:57:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:41,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-20 09:57:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,103 INFO L225 Difference]: With dead ends: 23 [2019-01-20 09:57:41,103 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 09:57:41,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:41,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 09:57:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-20 09:57:41,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 09:57:41,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-01-20 09:57:41,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,110 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 09:57:41,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 09:57:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:41,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,111 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-01-20 09:57:41,111 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-01-20 09:57:41,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:41,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,240 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-20 09:57:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:41,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,295 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-20 09:57:41,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:41,304 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-20 09:57:41,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 09:57:41,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:41,816 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-20 09:57:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,897 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-20 09:57:41,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:41,898 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-20 09:57:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,900 INFO L225 Difference]: With dead ends: 27 [2019-01-20 09:57:41,900 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 09:57:41,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 09:57:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-20 09:57:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 09:57:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-20 09:57:41,906 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-01-20 09:57:41,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,906 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-20 09:57:41,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:41,907 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-20 09:57:41,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 09:57:41,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,908 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-01-20 09:57:41,908 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,908 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-01-20 09:57:41,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:41,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,134 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-20 09:57:42,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:42,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:42,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 09:57:42,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:42,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 09:57:42,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,193 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-20 09:57:42,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 09:57:42,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:42,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:42,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:42,517 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-01-20 09:57:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:42,561 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-20 09:57:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:42,562 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-01-20 09:57:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:42,563 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:42,563 INFO L226 Difference]: Without dead ends: 30 [2019-01-20 09:57:42,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-20 09:57:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-20 09:57:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 09:57:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-20 09:57:42,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-01-20 09:57:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,570 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-20 09:57:42,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-20 09:57:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 09:57:42,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,571 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-01-20 09:57:42,572 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-01-20 09:57:42,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,702 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-20 09:57:42,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:42,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:42,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:42,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:42,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,739 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-20 09:57:42,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,748 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-20 09:57:42,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-20 09:57:43,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:43,056 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-01-20 09:57:43,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,137 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 09:57:43,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:43,138 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-01-20 09:57:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,140 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:43,140 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 09:57:43,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 09:57:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-01-20 09:57:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 09:57:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-20 09:57:43,146 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-01-20 09:57:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,147 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-20 09:57:43,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-20 09:57:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 09:57:43,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,148 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-01-20 09:57:43,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:43,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-01-20 09:57:43,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:43,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:43,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:43,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:43,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,311 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-20 09:57:43,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:43,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:43,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:43,367 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-20 09:57:43,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:43,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-20 09:57:43,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-20 09:57:43,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:43,737 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-01-20 09:57:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,975 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-20 09:57:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:43,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-01-20 09:57:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,977 INFO L225 Difference]: With dead ends: 39 [2019-01-20 09:57:43,977 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 09:57:43,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 09:57:43,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-20 09:57:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 09:57:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-20 09:57:43,983 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-01-20 09:57:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,984 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-20 09:57:43,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:43,984 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-20 09:57:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 09:57:43,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,985 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-01-20 09:57:43,985 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:43,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-01-20 09:57:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:43,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:44,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:44,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:44,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:44,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,170 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-20 09:57:44,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:44,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:44,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 09:57:44,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:44,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:44,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 09:57:44,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:44,228 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-20 09:57:44,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:44,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:44,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:44,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-20 09:57:44,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:44,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:57:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:57:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:57:44,697 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-01-20 09:57:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:44,795 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-20 09:57:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:44,795 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-01-20 09:57:44,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:44,796 INFO L225 Difference]: With dead ends: 43 [2019-01-20 09:57:44,796 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 09:57:44,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:57:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 09:57:44,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-01-20 09:57:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:57:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 09:57:44,803 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-01-20 09:57:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:44,804 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 09:57:44,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:57:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 09:57:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:57:44,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:44,805 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-01-20 09:57:44,805 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-01-20 09:57:44,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:44,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:44,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:44,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:44,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:45,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:45,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:45,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:57:45,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:45,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:45,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:45,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:45,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:45,059 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-20 09:57:45,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,064 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-20 09:57:45,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:45,301 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-20 09:57:45,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:45,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:45,626 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-01-20 09:57:45,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:45,793 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-20 09:57:45,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:45,793 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-01-20 09:57:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:45,794 INFO L225 Difference]: With dead ends: 47 [2019-01-20 09:57:45,794 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 09:57:45,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 09:57:45,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-20 09:57:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:57:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-20 09:57:45,801 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-01-20 09:57:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:45,802 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-20 09:57:45,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:45,802 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-20 09:57:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:57:45,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:45,803 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-01-20 09:57:45,803 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-01-20 09:57:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:45,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:46,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:46,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:46,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,141 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-20 09:57:46,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:46,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:46,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:46,199 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-20 09:57:46,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:46,244 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-20 09:57:46,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-20 09:57:46,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:46,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 09:57:46,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 09:57:46,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 09:57:46,722 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-01-20 09:57:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:46,803 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-20 09:57:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:46,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-20 09:57:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:46,805 INFO L225 Difference]: With dead ends: 51 [2019-01-20 09:57:46,806 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 09:57:46,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 09:57:46,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 09:57:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-01-20 09:57:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:57:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-20 09:57:46,811 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-01-20 09:57:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:46,812 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-20 09:57:46,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 09:57:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-20 09:57:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:57:46,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:46,813 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-01-20 09:57:46,813 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:46,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-01-20 09:57:46,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,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 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-20 09:57:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:47,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:47,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 09:57:47,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:47,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:47,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 09:57:47,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,134 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-20 09:57:47,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:47,706 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:47,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-20 09:57:47,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:47,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:47,726 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-01-20 09:57:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,816 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 09:57:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:47,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-01-20 09:57:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,817 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:57:47,818 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 09:57:47,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 09:57:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-20 09:57:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 09:57:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-20 09:57:47,824 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-01-20 09:57:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,824 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-20 09:57:47,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-20 09:57:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 09:57:47,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,826 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-01-20 09:57:47,826 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-01-20 09:57:47,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,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 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-20 09:57:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:48,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:48,345 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:48,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:48,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,352 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-20 09:57:48,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,360 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-20 09:57:48,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:48,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-20 09:57:48,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:48,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:48,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 09:57:48,984 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-01-20 09:57:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:49,104 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-20 09:57:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:49,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-01-20 09:57:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:49,105 INFO L225 Difference]: With dead ends: 59 [2019-01-20 09:57:49,105 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 09:57:49,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 09:57:49,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 09:57:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-20 09:57:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 09:57:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-20 09:57:49,111 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-01-20 09:57:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:49,111 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-20 09:57:49,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-20 09:57:49,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 09:57:49,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:49,112 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-01-20 09:57:49,113 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-01-20 09:57:49,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:49,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:49,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:49,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,460 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-20 09:57:49,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:49,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:49,496 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-20 09:57:49,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:49,500 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-20 09:57:49,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:50,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:50,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-20 09:57:50,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:50,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 09:57:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 09:57:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:50,654 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-01-20 09:57:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:50,927 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-20 09:57:50,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:50,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-01-20 09:57:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:50,928 INFO L225 Difference]: With dead ends: 63 [2019-01-20 09:57:50,929 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 09:57:50,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:50,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 09:57:50,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-20 09:57:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:57:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 09:57:50,935 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-01-20 09:57:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:50,936 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 09:57:50,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 09:57:50,936 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 09:57:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:57:50,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:50,937 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-01-20 09:57:50,937 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-01-20 09:57:50,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:51,678 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:51,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:51,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:51,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,679 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-20 09:57:51,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:51,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:51,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 09:57:51,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:51,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:51,736 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-20 09:57:51,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:51,741 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-20 09:57:51,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:52,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:53,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-20 09:57:53,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:53,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:53,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:53,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:57:53,125 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-01-20 09:57:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:53,332 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-20 09:57:53,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:53,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-01-20 09:57:53,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:53,334 INFO L225 Difference]: With dead ends: 67 [2019-01-20 09:57:53,334 INFO L226 Difference]: Without dead ends: 66 [2019-01-20 09:57:53,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:57:53,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-20 09:57:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-20 09:57:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 09:57:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-20 09:57:53,341 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-01-20 09:57:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:53,342 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-20 09:57:53,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-20 09:57:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 09:57:53,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:53,343 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-01-20 09:57:53,343 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-01-20 09:57:53,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:53,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:53,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:53,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:53,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:53,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:53,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,604 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-20 09:57:53,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:53,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:53,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:53,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:53,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:53,644 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-20 09:57:53,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:53,651 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-20 09:57:53,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:54,199 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-20 09:57:54,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:54,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:57:54,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:57:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:54,221 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-01-20 09:57:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:54,384 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-20 09:57:54,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:54,384 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-01-20 09:57:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:54,385 INFO L225 Difference]: With dead ends: 71 [2019-01-20 09:57:54,385 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 09:57:54,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 09:57:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-20 09:57:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 09:57:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-20 09:57:54,391 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-01-20 09:57:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:54,392 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-20 09:57:54,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:57:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-20 09:57:54,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 09:57:54,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:54,393 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-01-20 09:57:54,393 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:54,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-01-20 09:57:54,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:54,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:54,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:54,688 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:54,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,688 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-20 09:57:54,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:54,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:54,723 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-20 09:57:54,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:54,735 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-20 09:57:54,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:55,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:55,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:55,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-20 09:57:55,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:55,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 09:57:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 09:57:55,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 09:57:55,986 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-01-20 09:57:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:56,086 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 09:57:56,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:56,086 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-01-20 09:57:56,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:56,087 INFO L225 Difference]: With dead ends: 75 [2019-01-20 09:57:56,088 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 09:57:56,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 09:57:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 09:57:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-01-20 09:57:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 09:57:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-20 09:57:56,094 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-01-20 09:57:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:56,094 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-20 09:57:56,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 09:57:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-20 09:57:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 09:57:56,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:56,095 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-01-20 09:57:56,096 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-01-20 09:57:56,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:56,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:57,017 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:57,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:57,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:57,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:57,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,018 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-20 09:57:57,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:57,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:57,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 09:57:57,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:57,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:57,093 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-20 09:57:57,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:57,129 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-20 09:57:57,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:57,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:57,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:57,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-20 09:57:57,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:57,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:57:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:57:57,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:57,878 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-01-20 09:57:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:57,995 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-20 09:57:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:58,000 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-01-20 09:57:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:58,001 INFO L225 Difference]: With dead ends: 79 [2019-01-20 09:57:58,001 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 09:57:58,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 09:57:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-20 09:57:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 09:57:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-20 09:57:58,007 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-01-20 09:57:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:58,012 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-20 09:57:58,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:57:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-20 09:57:58,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 09:57:58,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:58,014 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-01-20 09:57:58,015 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-01-20 09:57:58,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:58,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:57:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:58,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:58,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:58,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:58,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,355 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-20 09:57:58,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:58,368 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-20 09:57:58,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:59,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:59,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-20 09:57:59,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:57:59,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:57:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:57:59,554 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-01-20 09:57:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:59,743 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-20 09:57:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:57:59,743 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-01-20 09:57:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:59,744 INFO L225 Difference]: With dead ends: 83 [2019-01-20 09:57:59,745 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 09:57:59,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:57:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 09:57:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-20 09:57:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 09:57:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 09:57:59,749 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-01-20 09:57:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:59,750 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 09:57:59,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:57:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 09:57:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 09:57:59,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:59,751 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-01-20 09:57:59,752 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-01-20 09:57:59,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:59,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:59,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:00,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:00,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:00,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:00,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:00,222 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-20 09:58:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:00,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:00,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:00,259 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-20 09:58:00,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:00,268 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-20 09:58:00,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:00,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:01,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-20 09:58:01,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:01,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 09:58:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 09:58:01,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:58:01,186 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-01-20 09:58:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:01,316 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-20 09:58:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:58:01,317 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-01-20 09:58:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:01,318 INFO L225 Difference]: With dead ends: 87 [2019-01-20 09:58:01,318 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 09:58:01,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:58:01,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 09:58:01,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-01-20 09:58:01,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 09:58:01,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-20 09:58:01,324 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-01-20 09:58:01,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:01,324 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-20 09:58:01,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 09:58:01,324 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-20 09:58:01,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 09:58:01,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:01,325 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-01-20 09:58:01,326 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:01,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:01,326 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-01-20 09:58:01,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:01,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:01,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:01,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:01,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:01,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,698 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-20 09:58:01,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:01,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:01,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 09:58:01,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:01,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:01,765 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-20 09:58:01,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:01,773 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-20 09:58:01,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:02,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-20 09:58:02,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:02,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 09:58:02,744 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-01-20 09:58:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:02,914 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-20 09:58:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:58:02,915 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-01-20 09:58:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:02,916 INFO L225 Difference]: With dead ends: 91 [2019-01-20 09:58:02,916 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 09:58:02,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 09:58:02,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 09:58:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-01-20 09:58:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 09:58:02,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-20 09:58:02,923 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-01-20 09:58:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:02,923 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-20 09:58:02,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:02,923 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-20 09:58:02,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 09:58:02,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:02,924 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-01-20 09:58:02,924 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:02,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:02,925 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-01-20 09:58:02,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:02,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:02,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:03,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:03,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:03,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:03,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,344 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-20 09:58:03,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:03,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:03,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:03,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:03,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:03,439 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-20 09:58:03,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:03,522 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-20 09:58:03,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:03,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:04,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:04,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-20 09:58:04,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:04,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:58:04,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:58:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:04,722 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-01-20 09:58:04,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:04,928 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 09:58:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 09:58:04,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-01-20 09:58:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:04,932 INFO L225 Difference]: With dead ends: 95 [2019-01-20 09:58:04,932 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 09:58:04,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 09:58:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-20 09:58:04,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 09:58:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-20 09:58:04,936 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-01-20 09:58:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:04,936 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-20 09:58:04,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:58:04,936 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-20 09:58:04,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 09:58:04,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:04,937 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-01-20 09:58:04,937 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:04,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:04,937 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-01-20 09:58:04,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:04,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:04,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,369 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:05,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:05,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:05,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:05,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,370 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-20 09:58:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:05,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:05,408 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-20 09:58:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:05,422 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-20 09:58:05,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:05,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:06,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:06,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-20 09:58:06,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:06,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 09:58:06,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 09:58:06,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 09:58:06,593 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-01-20 09:58:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:06,745 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-20 09:58:06,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:58:06,748 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-01-20 09:58:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:06,749 INFO L225 Difference]: With dead ends: 99 [2019-01-20 09:58:06,749 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 09:58:06,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 09:58:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 09:58:06,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-01-20 09:58:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 09:58:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-20 09:58:06,753 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-01-20 09:58:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:06,754 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-20 09:58:06,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 09:58:06,754 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-20 09:58:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 09:58:06,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:06,754 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-01-20 09:58:06,755 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-01-20 09:58:06,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:06,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:06,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:06,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:06,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:07,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:07,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:07,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:07,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:58:07,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:07,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:07,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 09:58:07,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:07,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:07,251 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-20 09:58:07,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,261 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-20 09:58:07,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:07,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:08,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-20 09:58:08,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:08,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:08,621 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-01-20 09:58:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:08,796 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-20 09:58:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:58:08,797 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-01-20 09:58:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:08,798 INFO L225 Difference]: With dead ends: 103 [2019-01-20 09:58:08,798 INFO L226 Difference]: Without dead ends: 102 [2019-01-20 09:58:08,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:08,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-20 09:58:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-01-20 09:58:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 09:58:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 09:58:08,804 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-01-20 09:58:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:08,804 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 09:58:08,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 09:58:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 09:58:08,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:08,805 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-01-20 09:58:08,805 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:08,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:08,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-01-20 09:58:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:08,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:08,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:09,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:09,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:09,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:09,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:09,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:09,468 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-20 09:58:09,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:09,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:09,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:09,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:09,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:09,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 09:58:09,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:09,542 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-20 09:58:09,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:10,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:10,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:11,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-20 09:58:11,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:11,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:58:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:58:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 09:58:11,125 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-01-20 09:58:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:11,313 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-20 09:58:11,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:58:11,313 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-01-20 09:58:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:11,314 INFO L225 Difference]: With dead ends: 107 [2019-01-20 09:58:11,314 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 09:58:11,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 09:58:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 09:58:11,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-20 09:58:11,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 09:58:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-20 09:58:11,320 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-01-20 09:58:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:11,320 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-20 09:58:11,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:58:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-20 09:58:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 09:58:11,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:11,321 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-01-20 09:58:11,322 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-01-20 09:58:11,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:11,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:11,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:11,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:11,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:11,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:11,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,930 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-20 09:58:11,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:11,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:11,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:11,973 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-20 09:58:11,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:11,984 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-20 09:58:11,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:12,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:13,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-20 09:58:13,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:13,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 09:58:13,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 09:58:13,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:13,443 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-01-20 09:58:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:13,643 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-20 09:58:13,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 09:58:13,644 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-01-20 09:58:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:13,645 INFO L225 Difference]: With dead ends: 111 [2019-01-20 09:58:13,645 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 09:58:13,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 09:58:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-01-20 09:58:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 09:58:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-20 09:58:13,650 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-01-20 09:58:13,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:13,651 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-20 09:58:13,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 09:58:13,651 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-20 09:58:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 09:58:13,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:13,651 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-01-20 09:58:13,652 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:13,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:13,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-01-20 09:58:13,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:13,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:13,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:13,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:14,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:14,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:14,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:14,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:14,182 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-20 09:58:14,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:14,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:14,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 09:58:14,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:14,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:14,270 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-20 09:58:14,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:14,281 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-20 09:58:14,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:14,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-20 09:58:15,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:15,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 09:58:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 09:58:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 09:58:15,893 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-01-20 09:58:16,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:16,071 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-20 09:58:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:58:16,071 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-01-20 09:58:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:16,072 INFO L225 Difference]: With dead ends: 115 [2019-01-20 09:58:16,072 INFO L226 Difference]: Without dead ends: 114 [2019-01-20 09:58:16,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 09:58:16,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-20 09:58:16,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-01-20 09:58:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 09:58:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-20 09:58:16,077 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-01-20 09:58:16,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:16,078 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-20 09:58:16,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 09:58:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-20 09:58:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 09:58:16,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:16,079 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-01-20 09:58:16,079 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-01-20 09:58:16,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:16,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:17,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:17,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:17,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:17,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:17,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:17,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:17,389 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-20 09:58:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:17,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:17,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:17,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:17,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:17,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 09:58:17,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:17,488 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-20 09:58:17,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:18,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:19,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:19,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-20 09:58:19,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:19,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:58:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:58:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:19,129 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-01-20 09:58:19,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:19,317 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-01-20 09:58:19,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:58:19,317 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-01-20 09:58:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:19,318 INFO L225 Difference]: With dead ends: 119 [2019-01-20 09:58:19,318 INFO L226 Difference]: Without dead ends: 118 [2019-01-20 09:58:19,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:19,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-20 09:58:19,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-20 09:58:19,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 09:58:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-20 09:58:19,323 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-01-20 09:58:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:19,323 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-20 09:58:19,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:58:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-20 09:58:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-20 09:58:19,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:19,324 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-01-20 09:58:19,324 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-01-20 09:58:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:19,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:19,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:19,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:19,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:20,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:20,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:20,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:20,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:20,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:20,123 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-20 09:58:20,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:20,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:20,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:20,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-20 09:58:20,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:20,265 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-20 09:58:20,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:21,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:22,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-20 09:58:22,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:22,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 09:58:22,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 09:58:22,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 09:58:22,144 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-01-20 09:58:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:22,370 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-01-20 09:58:22,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:58:22,371 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-01-20 09:58:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:22,372 INFO L225 Difference]: With dead ends: 123 [2019-01-20 09:58:22,372 INFO L226 Difference]: Without dead ends: 122 [2019-01-20 09:58:22,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 09:58:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-20 09:58:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-20 09:58:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 09:58:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-20 09:58:22,378 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-01-20 09:58:22,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:22,378 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-20 09:58:22,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 09:58:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-20 09:58:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-20 09:58:22,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:22,379 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-01-20 09:58:22,380 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-01-20 09:58:22,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:22,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:22,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:22,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:22,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,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 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-20 09:58:22,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:22,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:23,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 09:58:23,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:23,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:23,040 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-20 09:58:23,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:23,055 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-20 09:58:23,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:23,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-20 09:58:24,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 09:58:24,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 09:58:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:24,801 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-01-20 09:58:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:25,047 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-01-20 09:58:25,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:58:25,048 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-01-20 09:58:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:25,049 INFO L225 Difference]: With dead ends: 127 [2019-01-20 09:58:25,049 INFO L226 Difference]: Without dead ends: 126 [2019-01-20 09:58:25,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-20 09:58:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-01-20 09:58:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 09:58:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-01-20 09:58:25,053 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-01-20 09:58:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:25,053 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-01-20 09:58:25,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 09:58:25,053 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-01-20 09:58:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-20 09:58:25,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:25,054 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-01-20 09:58:25,054 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:25,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-01-20 09:58:25,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:25,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:25,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,974 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-20 09:58:25,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:25,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:26,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:26,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:26,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:26,029 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-20 09:58:26,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:26,042 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-20 09:58:26,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:26,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:27,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:27,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:27,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-20 09:58:27,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:27,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 09:58:27,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 09:58:27,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 09:58:27,934 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-01-20 09:58:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:28,173 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-20 09:58:28,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:58:28,174 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-01-20 09:58:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:28,175 INFO L225 Difference]: With dead ends: 131 [2019-01-20 09:58:28,175 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 09:58:28,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 09:58:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 09:58:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-01-20 09:58:28,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 09:58:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-01-20 09:58:28,180 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-01-20 09:58:28,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:28,181 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-01-20 09:58:28,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 09:58:28,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-01-20 09:58:28,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 09:58:28,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:28,182 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-01-20 09:58:28,182 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:28,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:28,182 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-01-20 09:58:28,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:28,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:28,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:28,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:28,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:28,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:28,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:28,836 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-20 09:58:28,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:28,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:28,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:28,889 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-20 09:58:28,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:28,900 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-20 09:58:28,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:31,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-20 09:58:31,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:31,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 09:58:31,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 09:58:31,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:31,212 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-01-20 09:58:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:31,434 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-20 09:58:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:58:31,435 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-01-20 09:58:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:31,436 INFO L225 Difference]: With dead ends: 135 [2019-01-20 09:58:31,436 INFO L226 Difference]: Without dead ends: 134 [2019-01-20 09:58:31,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-20 09:58:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-01-20 09:58:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 09:58:31,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-01-20 09:58:31,442 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-01-20 09:58:31,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:31,442 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-01-20 09:58:31,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 09:58:31,443 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-01-20 09:58:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 09:58:31,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:31,444 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-01-20 09:58:31,444 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:31,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-01-20 09:58:31,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:31,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:32,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:32,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:32,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,134 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-20 09:58:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:32,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:32,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-20 09:58:32,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:32,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:32,310 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-20 09:58:32,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:32,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-20 09:58:32,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:33,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-20 09:58:35,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:35,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 09:58:35,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 09:58:35,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 09:58:35,030 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-01-20 09:58:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:35,287 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-01-20 09:58:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:58:35,288 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-01-20 09:58:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:35,289 INFO L225 Difference]: With dead ends: 139 [2019-01-20 09:58:35,289 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 09:58:35,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 09:58:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 09:58:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-01-20 09:58:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 09:58:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-20 09:58:35,295 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-01-20 09:58:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:35,295 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-20 09:58:35,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 09:58:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-20 09:58:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-20 09:58:35,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:35,296 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-01-20 09:58:35,296 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-01-20 09:58:35,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:35,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:35,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:36,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:36,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:36,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,126 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-20 09:58:36,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:36,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:36,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:36,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:36,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:36,197 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-20 09:58:36,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:36,279 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-20 09:58:36,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:37,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:39,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:39,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-20 09:58:39,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 09:58:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 09:58:39,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:58:39,022 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-01-20 09:58:39,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:39,348 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-01-20 09:58:39,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:39,349 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-01-20 09:58:39,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:39,350 INFO L225 Difference]: With dead ends: 143 [2019-01-20 09:58:39,350 INFO L226 Difference]: Without dead ends: 142 [2019-01-20 09:58:39,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:58:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-20 09:58:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-01-20 09:58:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 09:58:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-20 09:58:39,356 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-01-20 09:58:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:39,357 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-20 09:58:39,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 09:58:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-20 09:58:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-20 09:58:39,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:39,358 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-01-20 09:58:39,358 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:39,358 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-01-20 09:58:39,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:39,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:39,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:39,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:40,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:40,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:40,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:40,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:40,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:40,102 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-20 09:58:40,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:40,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:40,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:40,168 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-20 09:58:40,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:40,189 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-20 09:58:40,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:41,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:43,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:43,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-20 09:58:43,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:43,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 09:58:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 09:58:43,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 09:58:43,110 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-01-20 09:58:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:43,529 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-01-20 09:58:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:58:43,530 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-01-20 09:58:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:43,531 INFO L225 Difference]: With dead ends: 147 [2019-01-20 09:58:43,531 INFO L226 Difference]: Without dead ends: 146 [2019-01-20 09:58:43,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 09:58:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-20 09:58:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-01-20 09:58:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-20 09:58:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-01-20 09:58:43,537 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-01-20 09:58:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:43,538 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-01-20 09:58:43,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 09:58:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-01-20 09:58:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-20 09:58:43,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:43,539 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-01-20 09:58:43,539 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:43,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-01-20 09:58:43,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:43,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:43,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:44,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:44,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:44,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:44,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:44,321 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-20 09:58:44,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:44,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:44,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 09:58:44,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:44,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:44,445 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-20 09:58:44,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:44,453 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-20 09:58:44,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:45,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:47,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:47,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-20 09:58:47,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:47,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 09:58:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 09:58:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:58:47,156 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-01-20 09:58:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:47,616 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-20 09:58:47,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:58:47,616 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-01-20 09:58:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:47,618 INFO L225 Difference]: With dead ends: 151 [2019-01-20 09:58:47,618 INFO L226 Difference]: Without dead ends: 150 [2019-01-20 09:58:47,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:58:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-20 09:58:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-20 09:58:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 09:58:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-01-20 09:58:47,624 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-01-20 09:58:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:47,624 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-01-20 09:58:47,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 09:58:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-01-20 09:58:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-20 09:58:47,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:47,625 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-01-20 09:58:47,625 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-01-20 09:58:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:47,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:47,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:50,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:50,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:50,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:50,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:50,353 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-20 09:58:50,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:50,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:50,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:50,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:50,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:50,444 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-20 09:58:50,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:50,454 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-20 09:58:50,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:51,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:51,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:53,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-20 09:58:53,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:53,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 09:58:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 09:58:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 09:58:53,450 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-01-20 09:58:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:53,762 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-20 09:58:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:58:53,763 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-01-20 09:58:53,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:53,767 INFO L225 Difference]: With dead ends: 155 [2019-01-20 09:58:53,767 INFO L226 Difference]: Without dead ends: 154 [2019-01-20 09:58:53,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 09:58:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-20 09:58:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-01-20 09:58:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-20 09:58:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-01-20 09:58:53,773 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-01-20 09:58:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:53,773 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-01-20 09:58:53,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 09:58:53,773 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-01-20 09:58:53,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-20 09:58:53,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:53,776 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-01-20 09:58:53,776 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:53,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-01-20 09:58:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:53,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:54,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:54,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:54,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:54,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:54,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:54,925 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-20 09:58:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:54,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:55,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 09:58:55,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:55,083 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-20 09:58:55,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:56,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:58,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-20 09:58:58,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:58,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 09:58:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 09:58:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:58:58,164 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-01-20 09:58:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:58,401 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-01-20 09:58:58,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:58:58,402 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-01-20 09:58:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:58,403 INFO L225 Difference]: With dead ends: 159 [2019-01-20 09:58:58,403 INFO L226 Difference]: Without dead ends: 158 [2019-01-20 09:58:58,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:58:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-20 09:58:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-01-20 09:58:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 09:58:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-20 09:58:58,409 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-01-20 09:58:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:58,410 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-20 09:58:58,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 09:58:58,410 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-20 09:58:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 09:58:58,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:58,411 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-01-20 09:58:58,411 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-01-20 09:58:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:58,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:59,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:59,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:59,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:59,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:59,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:59,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 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-20 09:58:59,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:59,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:59,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-20 09:58:59,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:59,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:59,424 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-20 09:58:59,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:59,438 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-20 09:58:59,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:00,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:02,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-20 09:59:02,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:02,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 09:59:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 09:59:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 09:59:02,553 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-01-20 09:59:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:02,832 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-01-20 09:59:02,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:59:02,833 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-01-20 09:59:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:02,834 INFO L225 Difference]: With dead ends: 163 [2019-01-20 09:59:02,834 INFO L226 Difference]: Without dead ends: 162 [2019-01-20 09:59:02,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 09:59:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-20 09:59:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-01-20 09:59:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 09:59:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-20 09:59:02,841 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-01-20 09:59:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-20 09:59:02,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 09:59:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-20 09:59:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 09:59:02,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:02,842 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-01-20 09:59:02,843 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-01-20 09:59:02,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:04,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:04,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:04,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:04,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:04,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:04,302 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-20 09:59:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:04,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:04,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:04,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:04,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:04,396 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-20 09:59:04,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:04,421 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-20 09:59:04,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:05,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:05,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:07,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:07,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-20 09:59:07,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:07,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 09:59:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 09:59:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:07,762 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-01-20 09:59:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:08,281 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-01-20 09:59:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 09:59:08,282 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-01-20 09:59:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:08,283 INFO L225 Difference]: With dead ends: 167 [2019-01-20 09:59:08,283 INFO L226 Difference]: Without dead ends: 166 [2019-01-20 09:59:08,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-20 09:59:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-01-20 09:59:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 09:59:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-01-20 09:59:08,289 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-01-20 09:59:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:08,290 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-01-20 09:59:08,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 09:59:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-01-20 09:59:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-20 09:59:08,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:08,291 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-01-20 09:59:08,291 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-01-20 09:59:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:09,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:09,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:09,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:09,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,322 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-20 09:59:09,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:09,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:09,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:09,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-20 09:59:09,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:09,481 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-20 09:59:09,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:10,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-20 09:59:12,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:12,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 09:59:12,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 09:59:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 09:59:12,994 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-01-20 09:59:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:13,266 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-20 09:59:13,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:59:13,267 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-01-20 09:59:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:13,268 INFO L225 Difference]: With dead ends: 171 [2019-01-20 09:59:13,268 INFO L226 Difference]: Without dead ends: 170 [2019-01-20 09:59:13,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 09:59:13,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-20 09:59:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-01-20 09:59:13,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-20 09:59:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-01-20 09:59:13,274 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-01-20 09:59:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:13,274 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-01-20 09:59:13,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 09:59:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-01-20 09:59:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-20 09:59:13,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:13,275 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-01-20 09:59:13,275 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:13,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:13,276 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-01-20 09:59:13,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:13,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:13,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:14,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:14,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:14,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:14,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,280 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-20 09:59:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:14,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:14,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-20 09:59:14,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:14,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:14,445 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-20 09:59:14,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:14,541 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-20 09:59:14,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:15,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:18,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:18,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:18,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-20 09:59:18,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:18,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 09:59:18,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 09:59:18,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 09:59:18,251 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-01-20 09:59:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:18,529 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-20 09:59:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:59:18,530 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-01-20 09:59:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:18,531 INFO L225 Difference]: With dead ends: 175 [2019-01-20 09:59:18,531 INFO L226 Difference]: Without dead ends: 174 [2019-01-20 09:59:18,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 09:59:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-20 09:59:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-01-20 09:59:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-20 09:59:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-01-20 09:59:18,537 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-01-20 09:59:18,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:18,537 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-01-20 09:59:18,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 09:59:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-01-20 09:59:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-20 09:59:18,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:18,539 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-01-20 09:59:18,539 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:18,539 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-01-20 09:59:18,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:19,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:19,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:19,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:19,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,577 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-20 09:59:19,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:19,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:19,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:19,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:19,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:19,660 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-20 09:59:19,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:19,679 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-20 09:59:19,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:20,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:23,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-20 09:59:23,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 09:59:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 09:59:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 09:59:23,408 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-01-20 09:59:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:23,965 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-01-20 09:59:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:59:23,965 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-01-20 09:59:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:23,966 INFO L225 Difference]: With dead ends: 179 [2019-01-20 09:59:23,967 INFO L226 Difference]: Without dead ends: 178 [2019-01-20 09:59:23,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 09:59:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-20 09:59:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-01-20 09:59:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-20 09:59:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-20 09:59:23,974 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-01-20 09:59:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:23,974 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-20 09:59:23,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 09:59:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-20 09:59:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-20 09:59:23,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:23,975 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-01-20 09:59:23,976 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:23,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:23,976 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-01-20 09:59:23,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:23,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:25,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:25,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:25,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:25,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,090 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-20 09:59:25,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:25,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:25,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:25,155 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-20 09:59:25,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:25,167 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-20 09:59:25,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:26,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:29,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:29,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-20 09:59:29,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:29,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 09:59:29,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 09:59:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 09:59:29,062 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-01-20 09:59:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:29,349 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-01-20 09:59:29,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 09:59:29,350 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-01-20 09:59:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:29,351 INFO L225 Difference]: With dead ends: 183 [2019-01-20 09:59:29,352 INFO L226 Difference]: Without dead ends: 182 [2019-01-20 09:59:29,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 09:59:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-20 09:59:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-01-20 09:59:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 09:59:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-20 09:59:29,356 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-01-20 09:59:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:29,356 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-20 09:59:29,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 09:59:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-20 09:59:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-20 09:59:29,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:29,357 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-01-20 09:59:29,357 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:29,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-01-20 09:59:29,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:29,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:31,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:31,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:31,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:31,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:31,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:31,084 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-20 09:59:31,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:31,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:31,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-20 09:59:31,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:31,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:31,256 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-20 09:59:31,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:31,268 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-20 09:59:31,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:32,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:35,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:35,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-20 09:59:35,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:35,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 09:59:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 09:59:35,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-20 09:59:35,245 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-01-20 09:59:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:35,593 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-01-20 09:59:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:59:35,593 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-01-20 09:59:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:35,595 INFO L225 Difference]: With dead ends: 187 [2019-01-20 09:59:35,595 INFO L226 Difference]: Without dead ends: 186 [2019-01-20 09:59:35,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-20 09:59:35,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-20 09:59:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-01-20 09:59:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 09:59:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-01-20 09:59:35,600 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-01-20 09:59:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:35,601 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-01-20 09:59:35,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 09:59:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-01-20 09:59:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 09:59:35,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:35,601 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-01-20 09:59:35,602 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-01-20 09:59:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:35,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:37,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:37,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:37,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:37,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:37,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:37,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:37,113 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-20 09:59:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:37,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:37,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:37,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:37,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:37,186 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-20 09:59:37,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:37,197 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-20 09:59:37,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:38,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:41,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:41,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-20 09:59:41,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:41,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 09:59:41,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 09:59:41,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 09:59:41,118 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-01-20 09:59:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:41,428 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-20 09:59:41,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 09:59:41,428 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-01-20 09:59:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:41,429 INFO L225 Difference]: With dead ends: 191 [2019-01-20 09:59:41,429 INFO L226 Difference]: Without dead ends: 190 [2019-01-20 09:59:41,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 09:59:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-20 09:59:41,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-01-20 09:59:41,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 09:59:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-01-20 09:59:41,436 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-01-20 09:59:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:41,436 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-01-20 09:59:41,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 09:59:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-01-20 09:59:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-20 09:59:41,437 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:41,437 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-01-20 09:59:41,437 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-01-20 09:59:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:41,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:41,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:43,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:43,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:43,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:43,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:43,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:43,478 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-20 09:59:43,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:43,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:43,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:43,548 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-20 09:59:43,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:43,559 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-20 09:59:43,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:45,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:48,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:48,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-20 09:59:48,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:48,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 09:59:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 09:59:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-20 09:59:48,744 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-01-20 09:59:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:49,104 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-20 09:59:49,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 09:59:49,104 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-01-20 09:59:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:49,106 INFO L225 Difference]: With dead ends: 195 [2019-01-20 09:59:49,106 INFO L226 Difference]: Without dead ends: 194 [2019-01-20 09:59:49,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-20 09:59:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-20 09:59:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-01-20 09:59:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 09:59:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-01-20 09:59:49,112 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-01-20 09:59:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-01-20 09:59:49,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 09:59:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-01-20 09:59:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-20 09:59:49,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:49,113 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-01-20 09:59:49,114 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-01-20 09:59:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:49,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:49,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:49,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:50,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:50,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:50,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:50,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:50,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:50,371 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-20 09:59:50,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:50,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:50,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-20 09:59:50,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:50,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:50,574 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-20 09:59:50,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:50,667 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-20 09:59:50,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:52,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:55,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:55,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-20 09:59:55,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:55,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 09:59:55,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 09:59:55,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 09:59:55,017 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-01-20 09:59:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:55,362 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-01-20 09:59:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 09:59:55,362 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-01-20 09:59:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:55,363 INFO L225 Difference]: With dead ends: 199 [2019-01-20 09:59:55,363 INFO L226 Difference]: Without dead ends: 198 [2019-01-20 09:59:55,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 09:59:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-20 09:59:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-01-20 09:59:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-20 09:59:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-20 09:59:55,369 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-01-20 09:59:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:55,370 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-20 09:59:55,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 09:59:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-20 09:59:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-20 09:59:55,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:55,371 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-01-20 09:59:55,371 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:55,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-01-20 09:59:55,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:55,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:56,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:56,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:56,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:56,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:56,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:56,689 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-20 09:59:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:56,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:56,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:56,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:56,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:56,764 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-20 09:59:56,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:56,777 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-20 09:59:56,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:58,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:01,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:01,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-20 10:00:01,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:01,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:00:01,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:00:01,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-20 10:00:01,487 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-01-20 10:00:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:01,857 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-01-20 10:00:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:00:01,857 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-01-20 10:00:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:01,859 INFO L225 Difference]: With dead ends: 203 [2019-01-20 10:00:01,859 INFO L226 Difference]: Without dead ends: 202 [2019-01-20 10:00:01,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-20 10:00:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-20 10:00:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-01-20 10:00:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-20 10:00:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-20 10:00:01,864 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-01-20 10:00:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:01,864 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-20 10:00:01,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:00:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-20 10:00:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-20 10:00:01,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:01,865 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-01-20 10:00:01,865 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:01,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:01,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-01-20 10:00:01,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:01,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:01,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:01,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:03,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:03,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:03,410 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:03,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:03,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:03,411 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-20 10:00:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:03,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:03,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:03,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:00:03,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:03,492 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-20 10:00:03,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:04,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:08,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-20 10:00:08,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:08,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:00:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:00:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:00:08,469 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-01-20 10:00:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:08,790 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-01-20 10:00:08,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:00:08,790 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-01-20 10:00:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:08,792 INFO L225 Difference]: With dead ends: 207 [2019-01-20 10:00:08,792 INFO L226 Difference]: Without dead ends: 206 [2019-01-20 10:00:08,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:00:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-20 10:00:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-01-20 10:00:08,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-20 10:00:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-01-20 10:00:08,799 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-01-20 10:00:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:08,799 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-01-20 10:00:08,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:00:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-01-20 10:00:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-20 10:00:08,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:08,801 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-01-20 10:00:08,801 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:08,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-01-20 10:00:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:08,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:08,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:08,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:10,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:10,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:10,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,220 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-20 10:00:10,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:10,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:10,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-20 10:00:10,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:10,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:10,426 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-20 10:00:10,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:10,439 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-20 10:00:10,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:11,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:11,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:15,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:15,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-20 10:00:15,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:15,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:00:15,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:00:15,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-20 10:00:15,399 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-01-20 10:00:15,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:15,805 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-20 10:00:15,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:00:15,805 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-01-20 10:00:15,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:15,806 INFO L225 Difference]: With dead ends: 211 [2019-01-20 10:00:15,806 INFO L226 Difference]: Without dead ends: 210 [2019-01-20 10:00:15,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-20 10:00:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-20 10:00:15,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-01-20 10:00:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-20 10:00:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-01-20 10:00:15,812 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-01-20 10:00:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:15,813 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-01-20 10:00:15,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:00:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-01-20 10:00:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-20 10:00:15,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:15,814 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-01-20 10:00:15,814 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-01-20 10:00:15,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:15,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:15,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:15,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:15,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:17,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:17,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:17,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:17,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:17,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:17,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:00:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:17,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:17,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:17,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:17,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:17,595 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-20 10:00:17,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:17,694 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-20 10:00:17,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:20,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:24,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:24,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-01-20 10:00:24,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:24,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:00:24,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:00:24,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:00:24,309 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-01-20 10:00:24,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:24,718 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-20 10:00:24,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:00:24,718 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-01-20 10:00:24,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:24,720 INFO L225 Difference]: With dead ends: 215 [2019-01-20 10:00:24,720 INFO L226 Difference]: Without dead ends: 214 [2019-01-20 10:00:24,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:00:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-20 10:00:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-01-20 10:00:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:00:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-01-20 10:00:24,726 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-01-20 10:00:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:24,726 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-01-20 10:00:24,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:00:24,726 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-01-20 10:00:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:00:24,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:24,727 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-01-20 10:00:24,727 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-01-20 10:00:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:24,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:24,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:26,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:26,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:26,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:26,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:26,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:26,099 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-20 10:00:26,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:26,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:26,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:26,186 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-20 10:00:26,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:26,238 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-20 10:00:26,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:28,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:28,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:31,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:31,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:31,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-01-20 10:00:31,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:31,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:00:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:00:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:00:31,449 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-01-20 10:00:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:31,814 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-01-20 10:00:31,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:00:31,814 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-01-20 10:00:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:31,816 INFO L225 Difference]: With dead ends: 219 [2019-01-20 10:00:31,816 INFO L226 Difference]: Without dead ends: 218 [2019-01-20 10:00:31,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:00:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-20 10:00:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-01-20 10:00:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:00:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-20 10:00:31,821 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-01-20 10:00:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:31,821 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-20 10:00:31,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:00:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-20 10:00:31,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-20 10:00:31,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:31,822 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-01-20 10:00:31,822 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:31,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-01-20 10:00:31,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:31,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:31,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:31,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:31,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:33,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:33,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:33,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:33,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:33,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:33,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:33,551 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-20 10:00:33,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:33,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:33,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-20 10:00:33,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:33,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:33,782 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-20 10:00:33,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:33,790 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-20 10:00:33,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:35,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:38,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:38,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:38,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-01-20 10:00:38,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:38,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:00:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:00:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:00:38,976 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-01-20 10:00:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:39,378 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-01-20 10:00:39,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:00:39,379 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-01-20 10:00:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:39,380 INFO L225 Difference]: With dead ends: 223 [2019-01-20 10:00:39,380 INFO L226 Difference]: Without dead ends: 222 [2019-01-20 10:00:39,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:00:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-20 10:00:39,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-01-20 10:00:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:00:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-20 10:00:39,387 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-01-20 10:00:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:39,387 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-20 10:00:39,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:00:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-20 10:00:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-20 10:00:39,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:39,388 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-01-20 10:00:39,388 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-01-20 10:00:39,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:39,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:39,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:40,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:40,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:40,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:40,904 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-20 10:00:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:40,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:40,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:40,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:40,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:40,987 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-20 10:00:40,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:41,002 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-20 10:00:41,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:42,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:46,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:46,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-01-20 10:00:46,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:46,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:00:46,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:00:46,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:00:46,464 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-01-20 10:00:46,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:46,908 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-01-20 10:00:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:00:46,909 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-01-20 10:00:46,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:46,910 INFO L225 Difference]: With dead ends: 227 [2019-01-20 10:00:46,910 INFO L226 Difference]: Without dead ends: 226 [2019-01-20 10:00:46,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:00:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-20 10:00:46,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-01-20 10:00:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:00:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-01-20 10:00:46,916 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-01-20 10:00:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:46,917 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-01-20 10:00:46,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:00:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-01-20 10:00:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-20 10:00:46,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:46,918 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-01-20 10:00:46,918 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-01-20 10:00:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:46,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:46,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:48,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:48,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:48,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:48,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:48,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:48,514 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-20 10:00:48,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:48,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:48,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:48,589 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-20 10:00:48,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:48,597 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-20 10:00:48,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:50,461 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:50,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:54,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:54,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-01-20 10:00:54,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:54,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-20 10:00:54,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-20 10:00:54,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:00:54,163 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-01-20 10:00:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:54,631 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-20 10:00:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:00:54,632 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-01-20 10:00:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:54,634 INFO L225 Difference]: With dead ends: 231 [2019-01-20 10:00:54,634 INFO L226 Difference]: Without dead ends: 230 [2019-01-20 10:00:54,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:00:54,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-20 10:00:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-01-20 10:00:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-20 10:00:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-01-20 10:00:54,641 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-01-20 10:00:54,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:54,641 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-01-20 10:00:54,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-20 10:00:54,641 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-01-20 10:00:54,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-20 10:00:54,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:54,642 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-01-20 10:00:54,643 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-01-20 10:00:54,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:54,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:54,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:54,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:56,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:56,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:56,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:56,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:56,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:56,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 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-20 10:00:56,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:56,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:56,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-20 10:00:56,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:56,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:56,513 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-20 10:00:56,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:56,526 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-20 10:00:56,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:58,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:02,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:02,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-01-20 10:01:02,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:02,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-20 10:01:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-20 10:01:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-20 10:01:02,175 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-01-20 10:01:02,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:02,635 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-20 10:01:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:01:02,635 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-01-20 10:01:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:02,636 INFO L225 Difference]: With dead ends: 235 [2019-01-20 10:01:02,636 INFO L226 Difference]: Without dead ends: 234 [2019-01-20 10:01:02,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-20 10:01:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-20 10:01:02,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-01-20 10:01:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-20 10:01:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-01-20 10:01:02,643 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-01-20 10:01:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:02,643 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-01-20 10:01:02,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-20 10:01:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-01-20 10:01:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-20 10:01:02,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:02,645 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-01-20 10:01:02,645 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-01-20 10:01:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:02,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:02,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:04,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:04,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:04,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:04,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:04,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:04,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:01:04,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:04,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:04,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:04,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:04,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:04,680 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-20 10:01:04,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:04,689 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-20 10:01:04,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:06,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:10,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:10,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-01-20 10:01:10,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:10,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-20 10:01:10,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-20 10:01:10,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:01:10,576 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-01-20 10:01:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:11,031 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-01-20 10:01:11,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:01:11,032 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-01-20 10:01:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:11,033 INFO L225 Difference]: With dead ends: 239 [2019-01-20 10:01:11,033 INFO L226 Difference]: Without dead ends: 238 [2019-01-20 10:01:11,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:01:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-20 10:01:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-01-20 10:01:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-20 10:01:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-20 10:01:11,039 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-01-20 10:01:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:11,039 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-20 10:01:11,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-20 10:01:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-20 10:01:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-20 10:01:11,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:11,040 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-01-20 10:01:11,040 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-01-20 10:01:11,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:11,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:11,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:11,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:12,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:12,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:12,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:12,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:12,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:12,723 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-20 10:01:12,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:12,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:12,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:12,801 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-20 10:01:12,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:12,816 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-20 10:01:12,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:15,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:18,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-01-20 10:01:18,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:18,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-20 10:01:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-20 10:01:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:01:18,647 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-01-20 10:01:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:19,170 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-01-20 10:01:19,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:01:19,170 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-01-20 10:01:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:19,172 INFO L225 Difference]: With dead ends: 243 [2019-01-20 10:01:19,172 INFO L226 Difference]: Without dead ends: 242 [2019-01-20 10:01:19,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:01:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-20 10:01:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-01-20 10:01:19,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-20 10:01:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-20 10:01:19,178 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-01-20 10:01:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:19,178 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-20 10:01:19,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-20 10:01:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-20 10:01:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-20 10:01:19,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:19,180 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-01-20 10:01:19,180 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-01-20 10:01:19,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:19,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:21,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:21,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:21,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:21,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:21,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:21,045 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-20 10:01:21,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:21,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:21,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-20 10:01:21,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:21,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:21,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:01:21,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:21,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-20 10:01:21,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:23,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:27,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:27,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-01-20 10:01:27,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:27,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-20 10:01:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-20 10:01:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:01:27,312 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-01-20 10:01:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:27,783 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-01-20 10:01:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:01:27,783 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-01-20 10:01:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:27,784 INFO L225 Difference]: With dead ends: 247 [2019-01-20 10:01:27,784 INFO L226 Difference]: Without dead ends: 246 [2019-01-20 10:01:27,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:01:27,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-20 10:01:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-01-20 10:01:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-20 10:01:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-01-20 10:01:27,790 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-01-20 10:01:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:27,791 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-01-20 10:01:27,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-20 10:01:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-01-20 10:01:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-20 10:01:27,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:27,792 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-01-20 10:01:27,792 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-01-20 10:01:27,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:27,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:27,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:27,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:27,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:29,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:29,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:29,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:29,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:29,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:29,820 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-20 10:01:29,829 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:29,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:29,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:29,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:29,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:29,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-20 10:01:29,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:29,915 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-20 10:01:29,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:32,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:35,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:35,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-01-20 10:01:35,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:35,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-20 10:01:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-20 10:01:35,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:01:35,945 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-01-20 10:01:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:36,439 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-20 10:01:36,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:01:36,439 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-01-20 10:01:36,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:36,441 INFO L225 Difference]: With dead ends: 251 [2019-01-20 10:01:36,441 INFO L226 Difference]: Without dead ends: 250 [2019-01-20 10:01:36,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:01:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-20 10:01:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-01-20 10:01:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-20 10:01:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-01-20 10:01:36,448 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-01-20 10:01:36,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:36,449 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-01-20 10:01:36,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-20 10:01:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-01-20 10:01:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-20 10:01:36,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:36,450 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-01-20 10:01:36,450 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-01-20 10:01:36,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:36,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:36,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:36,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:38,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:38,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:38,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:38,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:38,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:38,372 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-20 10:01:38,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:38,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:38,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:38,468 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-20 10:01:38,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:38,479 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-20 10:01:38,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:40,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:44,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:44,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-01-20 10:01:44,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:44,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-20 10:01:44,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-20 10:01:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:01:44,581 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-01-20 10:01:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:45,074 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-20 10:01:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:01:45,074 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-01-20 10:01:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:45,076 INFO L225 Difference]: With dead ends: 255 [2019-01-20 10:01:45,076 INFO L226 Difference]: Without dead ends: 254 [2019-01-20 10:01:45,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:01:45,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-20 10:01:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-01-20 10:01:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-20 10:01:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-01-20 10:01:45,081 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-01-20 10:01:45,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:45,081 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-01-20 10:01:45,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-20 10:01:45,082 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-01-20 10:01:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-20 10:01:45,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:45,083 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-01-20 10:01:45,083 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-01-20 10:01:45,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:45,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:45,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:46,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:46,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:46,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:46,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,967 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-20 10:01:46,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:46,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:47,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-20 10:01:47,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:47,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:47,271 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-20 10:01:47,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:47,281 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-20 10:01:47,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:49,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:53,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:53,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-01-20 10:01:53,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:53,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-20 10:01:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-20 10:01:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:01:53,347 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-01-20 10:01:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:53,798 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-01-20 10:01:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:01:53,798 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-01-20 10:01:53,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:53,799 INFO L225 Difference]: With dead ends: 259 [2019-01-20 10:01:53,800 INFO L226 Difference]: Without dead ends: 258 [2019-01-20 10:01:53,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:01:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-20 10:01:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-20 10:01:53,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-20 10:01:53,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-20 10:01:53,806 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-01-20 10:01:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:53,806 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-20 10:01:53,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-20 10:01:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-20 10:01:53,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-20 10:01:53,807 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:53,807 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-01-20 10:01:53,807 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-01-20 10:01:53,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:53,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:53,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:53,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:56,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:56,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:56,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:56,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:56,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:56,060 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-20 10:01:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:56,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:56,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:56,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:56,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:56,162 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-20 10:01:56,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:56,173 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-20 10:01:56,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:58,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:02,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:02,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-01-20 10:02:02,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:02,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-20 10:02:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-20 10:02:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:02:02,403 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-01-20 10:02:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:02,847 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-01-20 10:02:02,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:02:02,848 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-01-20 10:02:02,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:02,849 INFO L225 Difference]: With dead ends: 263 [2019-01-20 10:02:02,849 INFO L226 Difference]: Without dead ends: 262 [2019-01-20 10:02:02,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:02:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-20 10:02:02,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-01-20 10:02:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-20 10:02:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-20 10:02:02,857 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-01-20 10:02:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:02,858 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-20 10:02:02,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-20 10:02:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-20 10:02:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-20 10:02:02,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:02,859 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-01-20 10:02:02,859 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-01-20 10:02:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:04,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:04,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:04,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:04,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:04,920 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-20 10:02:04,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:04,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:05,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:05,010 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-20 10:02:05,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:05,026 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-20 10:02:05,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:07,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:11,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:11,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-01-20 10:02:11,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:11,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-20 10:02:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-20 10:02:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-20 10:02:11,702 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-01-20 10:02:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:12,178 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-01-20 10:02:12,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:02:12,179 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-01-20 10:02:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:12,180 INFO L225 Difference]: With dead ends: 267 [2019-01-20 10:02:12,180 INFO L226 Difference]: Without dead ends: 266 [2019-01-20 10:02:12,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-20 10:02:12,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-20 10:02:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-01-20 10:02:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-01-20 10:02:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-01-20 10:02:12,186 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-01-20 10:02:12,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:12,186 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-01-20 10:02:12,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-20 10:02:12,187 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-01-20 10:02:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-20 10:02:12,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:12,188 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-01-20 10:02:12,188 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-01-20 10:02:12,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:12,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:12,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:14,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:14,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:14,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:14,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,356 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-20 10:02:14,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:14,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:14,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-20 10:02:14,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:14,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:14,688 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-20 10:02:14,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:14,699 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-20 10:02:14,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:17,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:21,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-01-20 10:02:21,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:21,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-20 10:02:21,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-20 10:02:21,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:02:21,357 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-01-20 10:02:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:21,924 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-20 10:02:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:02:21,925 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-01-20 10:02:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:21,926 INFO L225 Difference]: With dead ends: 271 [2019-01-20 10:02:21,926 INFO L226 Difference]: Without dead ends: 270 [2019-01-20 10:02:21,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:02:21,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-20 10:02:21,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-01-20 10:02:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-20 10:02:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-01-20 10:02:21,932 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-01-20 10:02:21,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:21,932 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-01-20 10:02:21,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-20 10:02:21,932 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-01-20 10:02:21,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-20 10:02:21,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:21,934 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-01-20 10:02:21,934 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:21,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:21,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-01-20 10:02:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:21,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:21,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:21,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:24,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:24,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:24,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:24,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,114 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-20 10:02:24,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:24,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:24,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:24,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:24,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:24,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:02:24,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:24,219 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-20 10:02:24,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:27,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:30,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-01-20 10:02:30,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:30,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-20 10:02:30,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-20 10:02:30,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:02:30,902 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-01-20 10:02:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:31,453 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-20 10:02:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:02:31,453 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-01-20 10:02:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:31,454 INFO L225 Difference]: With dead ends: 275 [2019-01-20 10:02:31,454 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:02:31,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:02:31,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:02:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-01-20 10:02:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-20 10:02:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-01-20 10:02:31,460 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-01-20 10:02:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:31,460 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-01-20 10:02:31,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-20 10:02:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-01-20 10:02:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-20 10:02:31,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:31,461 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-01-20 10:02:31,461 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-01-20 10:02:31,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:31,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:31,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:31,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:33,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:33,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:33,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:33,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:33,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:33,652 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-20 10:02:33,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:33,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:33,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:33,740 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-20 10:02:33,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:33,750 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-20 10:02:33,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:36,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:40,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:40,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-01-20 10:02:40,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:40,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-20 10:02:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-20 10:02:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:02:40,331 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-01-20 10:02:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:40,924 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-01-20 10:02:40,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:02:40,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-01-20 10:02:40,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:40,926 INFO L225 Difference]: With dead ends: 279 [2019-01-20 10:02:40,926 INFO L226 Difference]: Without dead ends: 278 [2019-01-20 10:02:40,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:02:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-20 10:02:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-01-20 10:02:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-20 10:02:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-20 10:02:40,932 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-01-20 10:02:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:40,933 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-20 10:02:40,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-20 10:02:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-20 10:02:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-20 10:02:40,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:40,934 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-01-20 10:02:40,935 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-01-20 10:02:40,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:40,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:43,298 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:43,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:43,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:43,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:43,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:43,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:43,299 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-20 10:02:43,307 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:43,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:43,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-20 10:02:43,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:43,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:43,647 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-20 10:02:43,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,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-20 10:02:43,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:46,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:50,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:50,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-01-20 10:02:50,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:50,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-20 10:02:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-20 10:02:50,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:02:50,480 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-01-20 10:02:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:50,973 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-01-20 10:02:50,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:02:50,973 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-01-20 10:02:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:50,975 INFO L225 Difference]: With dead ends: 283 [2019-01-20 10:02:50,975 INFO L226 Difference]: Without dead ends: 282 [2019-01-20 10:02:50,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:02:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-20 10:02:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-01-20 10:02:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-20 10:02:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-20 10:02:50,981 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-01-20 10:02:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:50,982 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-20 10:02:50,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-20 10:02:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-20 10:02:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-20 10:02:50,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:50,984 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-01-20 10:02:50,984 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-01-20 10:02:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:50,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:50,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:53,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:53,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:53,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:53,448 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-20 10:02:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:53,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:53,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:53,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:53,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:53,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-20 10:02:53,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:53,569 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-20 10:02:53,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:56,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:00,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-01-20 10:03:00,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:00,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-20 10:03:00,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-20 10:03:00,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:00,365 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-01-20 10:03:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:00,908 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-01-20 10:03:00,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:03:00,908 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-01-20 10:03:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:00,910 INFO L225 Difference]: With dead ends: 287 [2019-01-20 10:03:00,910 INFO L226 Difference]: Without dead ends: 286 [2019-01-20 10:03:00,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:00,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-20 10:03:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-01-20 10:03:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-20 10:03:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-01-20 10:03:00,916 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-01-20 10:03:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:00,917 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-01-20 10:03:00,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-20 10:03:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-01-20 10:03:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-01-20 10:03:00,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:00,918 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-01-20 10:03:00,918 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-01-20 10:03:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:00,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:00,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:03,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:03,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:03,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:03,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:03,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:03,484 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-20 10:03:03,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:03,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:03,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:03,578 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-20 10:03:03,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:03,587 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-20 10:03:03,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:06,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:10,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:10,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-01-20 10:03:10,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:10,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-20 10:03:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-20 10:03:10,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-20 10:03:10,481 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-01-20 10:03:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:11,025 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-20 10:03:11,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:03:11,025 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-01-20 10:03:11,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:11,027 INFO L225 Difference]: With dead ends: 291 [2019-01-20 10:03:11,027 INFO L226 Difference]: Without dead ends: 290 [2019-01-20 10:03:11,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-20 10:03:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-20 10:03:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-01-20 10:03:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-01-20 10:03:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-01-20 10:03:11,033 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-01-20 10:03:11,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:11,033 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-01-20 10:03:11,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-20 10:03:11,034 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-01-20 10:03:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-01-20 10:03:11,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:11,035 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-01-20 10:03:11,035 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-01-20 10:03:11,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:11,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:11,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:13,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:13,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:13,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:13,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:13,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:13,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:13,778 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-20 10:03:13,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:13,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:14,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-20 10:03:14,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:14,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:14,156 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-20 10:03:14,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:14,167 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-20 10:03:14,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:17,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:21,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-01-20 10:03:21,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:21,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-20 10:03:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-20 10:03:21,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:21,518 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-01-20 10:03:22,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:22,130 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-20 10:03:22,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:03:22,131 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-01-20 10:03:22,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:22,133 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:03:22,133 INFO L226 Difference]: Without dead ends: 294 [2019-01-20 10:03:22,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-20 10:03:22,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-20 10:03:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-20 10:03:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-01-20 10:03:22,139 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-01-20 10:03:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:22,139 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-01-20 10:03:22,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-20 10:03:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-01-20 10:03:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-20 10:03:22,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:22,141 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-01-20 10:03:22,141 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-01-20 10:03:22,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:22,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:22,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:24,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:24,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:24,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:24,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:24,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:24,921 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-20 10:03:24,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:24,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:25,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:25,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:25,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:25,042 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-20 10:03:25,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:25,061 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-20 10:03:25,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:28,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:32,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-01-20 10:03:32,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:32,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-20 10:03:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-20 10:03:32,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:03:32,134 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-01-20 10:03:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:32,816 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-01-20 10:03:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:03:32,816 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-01-20 10:03:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:32,818 INFO L225 Difference]: With dead ends: 299 [2019-01-20 10:03:32,818 INFO L226 Difference]: Without dead ends: 298 [2019-01-20 10:03:32,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:03:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-20 10:03:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-01-20 10:03:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-20 10:03:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-20 10:03:32,824 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-01-20 10:03:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:32,824 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-20 10:03:32,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-20 10:03:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-20 10:03:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-20 10:03:32,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:32,825 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-01-20 10:03:32,826 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-01-20 10:03:32,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:32,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:32,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:32,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:32,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:35,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:35,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:35,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:35,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:35,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:35,502 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-20 10:03:35,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:35,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:35,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:35,599 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-20 10:03:35,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:35,610 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-20 10:03:35,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:39,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:39,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:43,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:43,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-01-20 10:03:43,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:43,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-20 10:03:43,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-20 10:03:43,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:03:43,163 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-01-20 10:03:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:43,687 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-01-20 10:03:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:03:43,688 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-01-20 10:03:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:43,690 INFO L225 Difference]: With dead ends: 303 [2019-01-20 10:03:43,690 INFO L226 Difference]: Without dead ends: 302 [2019-01-20 10:03:43,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:03:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-20 10:03:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-01-20 10:03:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-20 10:03:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-20 10:03:43,696 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-01-20 10:03:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:43,696 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-20 10:03:43,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-20 10:03:43,696 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-20 10:03:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-20 10:03:43,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:43,697 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-01-20 10:03:43,698 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-01-20 10:03:43,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:43,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:46,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:46,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:46,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:46,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:46,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:46,370 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-20 10:03:46,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:46,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:46,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-20 10:03:46,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:46,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:46,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:03:46,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:46,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:46,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:50,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:54,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:54,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-01-20 10:03:54,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:54,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-20 10:03:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-20 10:03:54,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-20 10:03:54,353 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-01-20 10:03:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:54,998 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-01-20 10:03:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:03:54,999 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-01-20 10:03:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:55,000 INFO L225 Difference]: With dead ends: 307 [2019-01-20 10:03:55,001 INFO L226 Difference]: Without dead ends: 306 [2019-01-20 10:03:55,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-20 10:03:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-20 10:03:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-20 10:03:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-20 10:03:55,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-01-20 10:03:55,006 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-01-20 10:03:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:55,007 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-01-20 10:03:55,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-20 10:03:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-01-20 10:03:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-20 10:03:55,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:55,008 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-01-20 10:03:55,008 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-01-20 10:03:55,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:55,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:55,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:55,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:57,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:57,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:57,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:57,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:57,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:57,687 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-20 10:03:57,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:57,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:57,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:57,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:57,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:57,801 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-20 10:03:57,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:57,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:03:57,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:01,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:05,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:05,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-01-20 10:04:05,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:05,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-20 10:04:05,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-20 10:04:05,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:05,396 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-01-20 10:04:05,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:05,995 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-20 10:04:05,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:04:05,995 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-01-20 10:04:05,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:05,997 INFO L225 Difference]: With dead ends: 311 [2019-01-20 10:04:05,997 INFO L226 Difference]: Without dead ends: 310 [2019-01-20 10:04:05,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:04:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-20 10:04:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-01-20 10:04:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-20 10:04:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-01-20 10:04:06,003 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-01-20 10:04:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:06,003 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-01-20 10:04:06,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-20 10:04:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-01-20 10:04:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-20 10:04:06,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:06,004 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-01-20 10:04:06,004 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:06,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:06,005 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-01-20 10:04:06,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:06,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:06,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:06,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:08,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:08,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:08,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:08,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:08,993 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-20 10:04:09,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:09,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:09,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:09,089 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-20 10:04:09,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:09,101 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-20 10:04:09,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:12,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:16,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:16,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-01-20 10:04:16,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:16,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-20 10:04:16,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-20 10:04:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-20 10:04:16,692 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-01-20 10:04:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:17,314 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-20 10:04:17,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:04:17,314 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-01-20 10:04:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:17,316 INFO L225 Difference]: With dead ends: 315 [2019-01-20 10:04:17,316 INFO L226 Difference]: Without dead ends: 314 [2019-01-20 10:04:17,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-20 10:04:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-20 10:04:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-01-20 10:04:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-20 10:04:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-01-20 10:04:17,324 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-01-20 10:04:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:17,324 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-01-20 10:04:17,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-20 10:04:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-01-20 10:04:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-20 10:04:17,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:17,326 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-01-20 10:04:17,326 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:17,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:17,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-01-20 10:04:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:17,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:17,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:20,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:20,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:20,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:20,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:20,435 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-20 10:04:20,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:20,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:20,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-20 10:04:20,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:20,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:20,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-20 10:04:20,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:20,915 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-20 10:04:20,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:24,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:28,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:28,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-01-20 10:04:28,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:28,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-20 10:04:28,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-20 10:04:28,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:28,597 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-01-20 10:04:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:29,219 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-01-20 10:04:29,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:04:29,220 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-01-20 10:04:29,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:29,221 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:04:29,221 INFO L226 Difference]: Without dead ends: 318 [2019-01-20 10:04:29,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-20 10:04:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-01-20 10:04:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-20 10:04:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-20 10:04:29,227 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-01-20 10:04:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:29,227 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-20 10:04:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-20 10:04:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-20 10:04:29,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-20 10:04:29,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:29,229 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-01-20 10:04:29,229 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:29,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:29,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-01-20 10:04:29,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:29,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:29,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:29,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:32,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:32,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:32,106 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:32,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:32,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:32,107 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-20 10:04:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:32,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:32,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:32,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:32,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:32,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:04:32,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:32,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:04:32,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:35,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:40,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:40,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-01-20 10:04:40,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:40,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-20 10:04:40,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-20 10:04:40,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:04:40,424 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-01-20 10:04:41,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:41,112 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-01-20 10:04:41,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:04:41,113 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-01-20 10:04:41,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:41,114 INFO L225 Difference]: With dead ends: 323 [2019-01-20 10:04:41,114 INFO L226 Difference]: Without dead ends: 322 [2019-01-20 10:04:41,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:04:41,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-20 10:04:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-01-20 10:04:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-20 10:04:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-20 10:04:41,119 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-01-20 10:04:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:41,119 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-20 10:04:41,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-20 10:04:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-20 10:04:41,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-20 10:04:41,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:41,120 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-01-20 10:04:41,121 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-01-20 10:04:41,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:41,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:41,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:41,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:41,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:44,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:44,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:44,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:44,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:44,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:44,338 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-20 10:04:44,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:44,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:44,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:44,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-20 10:04:44,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:44,449 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-20 10:04:44,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:48,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:52,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:52,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:52,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-01-20 10:04:52,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:52,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-20 10:04:52,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-20 10:04:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:52,183 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-01-20 10:04:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:52,845 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-01-20 10:04:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:04:52,845 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-01-20 10:04:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:52,847 INFO L225 Difference]: With dead ends: 327 [2019-01-20 10:04:52,847 INFO L226 Difference]: Without dead ends: 326 [2019-01-20 10:04:52,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-01-20 10:04:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-01-20 10:04:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-20 10:04:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-01-20 10:04:52,852 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-01-20 10:04:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:52,852 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-01-20 10:04:52,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-20 10:04:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-01-20 10:04:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-20 10:04:52,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:52,854 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-01-20 10:04:52,854 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-01-20 10:04:52,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:52,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:52,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:56,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:56,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:56,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:56,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:56,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:56,039 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-20 10:04:56,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:56,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:56,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-20 10:04:56,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:56,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:56,521 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-20 10:04:56,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:56,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-20 10:04:56,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:00,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:04,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-01-20 10:05:04,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:04,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-20 10:05:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-20 10:05:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-20 10:05:04,686 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-01-20 10:05:05,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:05,389 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-20 10:05:05,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:05:05,390 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-01-20 10:05:05,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:05,392 INFO L225 Difference]: With dead ends: 331 [2019-01-20 10:05:05,392 INFO L226 Difference]: Without dead ends: 330 [2019-01-20 10:05:05,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-20 10:05:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-20 10:05:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-01-20 10:05:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-20 10:05:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-01-20 10:05:05,398 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-01-20 10:05:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:05,398 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-01-20 10:05:05,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-20 10:05:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-01-20 10:05:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-01-20 10:05:05,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:05,400 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-01-20 10:05:05,400 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:05,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-01-20 10:05:05,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:05,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:05,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:05,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:08,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:08,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:08,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:08,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:08,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:08,479 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-20 10:05:08,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:08,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:08,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:08,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:08,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:08,602 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-20 10:05:08,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:16,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:16,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-01-20 10:05:16,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:16,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-20 10:05:16,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-20 10:05:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:16,967 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-01-20 10:05:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:17,651 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-20 10:05:17,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:05:17,652 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-01-20 10:05:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:17,653 INFO L225 Difference]: With dead ends: 335 [2019-01-20 10:05:17,653 INFO L226 Difference]: Without dead ends: 334 [2019-01-20 10:05:17,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:05:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-20 10:05:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-01-20 10:05:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-20 10:05:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-01-20 10:05:17,659 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-01-20 10:05:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:17,659 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-01-20 10:05:17,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-20 10:05:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-01-20 10:05:17,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-01-20 10:05:17,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:17,661 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-01-20 10:05:17,661 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-01-20 10:05:17,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:17,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:17,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:17,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:21,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:21,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:21,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:21,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:21,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:21,151 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-20 10:05:21,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:21,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:21,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:21,257 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-20 10:05:21,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,268 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-20 10:05:21,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:25,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:29,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:29,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-01-20 10:05:29,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:29,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-20 10:05:29,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-20 10:05:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:05:29,585 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-01-20 10:05:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:30,293 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-01-20 10:05:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:05:30,293 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-01-20 10:05:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:30,295 INFO L225 Difference]: With dead ends: 339 [2019-01-20 10:05:30,295 INFO L226 Difference]: Without dead ends: 338 [2019-01-20 10:05:30,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:05:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-20 10:05:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-01-20 10:05:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-20 10:05:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-20 10:05:30,301 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-01-20 10:05:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:30,301 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-20 10:05:30,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-20 10:05:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-20 10:05:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-20 10:05:30,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:30,303 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-01-20 10:05:30,303 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:30,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-01-20 10:05:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:30,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:30,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:30,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:30,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:33,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:33,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:33,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:33,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:33,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:33,608 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-20 10:05:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:33,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:34,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-20 10:05:34,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:34,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:34,115 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-20 10:05:34,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:34,123 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-20 10:05:34,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:38,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:42,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:42,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-01-20 10:05:42,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:42,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-20 10:05:42,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-20 10:05:42,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:42,693 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-01-20 10:05:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:43,466 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-01-20 10:05:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:05:43,467 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-01-20 10:05:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:43,468 INFO L225 Difference]: With dead ends: 343 [2019-01-20 10:05:43,468 INFO L226 Difference]: Without dead ends: 342 [2019-01-20 10:05:43,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:05:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-20 10:05:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-01-20 10:05:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-20 10:05:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-20 10:05:43,474 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-01-20 10:05:43,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:43,474 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-20 10:05:43,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-20 10:05:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-20 10:05:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-20 10:05:43,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:43,476 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-01-20 10:05:43,476 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:43,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:43,476 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-01-20 10:05:43,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:43,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:43,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:47,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:47,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:47,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:47,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:47,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:47,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 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-20 10:05:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:47,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:47,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:47,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:47,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:47,328 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-20 10:05:47,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,339 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-20 10:05:47,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:51,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:55,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:55,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-01-20 10:05:55,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-20 10:05:55,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-20 10:05:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:05:55,902 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-01-20 10:05:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:56,675 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-01-20 10:05:56,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:05:56,675 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-01-20 10:05:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:56,678 INFO L225 Difference]: With dead ends: 347 [2019-01-20 10:05:56,678 INFO L226 Difference]: Without dead ends: 346 [2019-01-20 10:05:56,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:05:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-20 10:05:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-01-20 10:05:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-01-20 10:05:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-01-20 10:05:56,684 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-01-20 10:05:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:56,685 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-01-20 10:05:56,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-20 10:05:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-01-20 10:05:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-01-20 10:05:56,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:56,686 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-01-20 10:05:56,687 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:56,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-01-20 10:05:56,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:56,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:00,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:00,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:00,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:00,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:00,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:00,074 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-20 10:06:00,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:00,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:00,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:00,197 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-20 10:06:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:00,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-20 10:06:00,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:04,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:09,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:09,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-01-20 10:06:09,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:09,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-20 10:06:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-20 10:06:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:06:09,164 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-01-20 10:06:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:09,926 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-20 10:06:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:06:09,927 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-01-20 10:06:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:09,929 INFO L225 Difference]: With dead ends: 351 [2019-01-20 10:06:09,929 INFO L226 Difference]: Without dead ends: 350 [2019-01-20 10:06:09,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:06:09,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-20 10:06:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-01-20 10:06:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-01-20 10:06:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-01-20 10:06:09,935 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-01-20 10:06:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:09,936 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-01-20 10:06:09,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-20 10:06:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-01-20 10:06:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-20 10:06:09,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:09,937 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-01-20 10:06:09,938 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:09,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:09,938 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-01-20 10:06:09,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:09,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:09,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:09,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:13,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:13,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:13,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:13,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:13,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:13,725 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-20 10:06:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:13,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:14,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-20 10:06:14,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:14,279 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-20 10:06:14,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,288 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-20 10:06:14,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:18,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:22,992 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:23,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:23,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-01-20 10:06:23,013 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:23,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-20 10:06:23,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-20 10:06:23,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-20 10:06:23,017 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-01-20 10:06:23,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:23,736 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-20 10:06:23,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:06:23,737 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-01-20 10:06:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:23,739 INFO L225 Difference]: With dead ends: 355 [2019-01-20 10:06:23,739 INFO L226 Difference]: Without dead ends: 354 [2019-01-20 10:06:23,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-20 10:06:23,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-20 10:06:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-01-20 10:06:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-01-20 10:06:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-01-20 10:06:23,745 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-01-20 10:06:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:23,746 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-01-20 10:06:23,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-20 10:06:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-01-20 10:06:23,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-20 10:06:23,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:23,747 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-01-20 10:06:23,747 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:23,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:23,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-01-20 10:06:23,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:23,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:23,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:23,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:27,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:27,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:27,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:27,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:27,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:27,791 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:27,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:27,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:27,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:27,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:27,929 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-20 10:06:27,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,939 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-20 10:06:27,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:32,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:37,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:37,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-01-20 10:06:37,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-20 10:06:37,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-20 10:06:37,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:06:37,046 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-01-20 10:06:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:37,750 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-01-20 10:06:37,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:06:37,751 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-01-20 10:06:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:37,752 INFO L225 Difference]: With dead ends: 359 [2019-01-20 10:06:37,752 INFO L226 Difference]: Without dead ends: 358 [2019-01-20 10:06:37,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:06:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-20 10:06:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-01-20 10:06:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-20 10:06:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-20 10:06:37,758 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-01-20 10:06:37,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:37,758 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-20 10:06:37,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-01-20 10:06:37,758 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-20 10:06:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-20 10:06:37,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:37,760 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-01-20 10:06:37,760 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:37,760 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-01-20 10:06:37,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:37,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:37,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:37,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:41,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:41,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:41,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:41,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:41,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:41,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:41,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:41,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:41,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:41,518 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-20 10:06:41,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,532 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-20 10:06:41,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:45,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:50,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:50,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-01-20 10:06:50,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:50,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-01-20 10:06:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-01-20 10:06:50,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:06:50,523 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-01-20 10:06:51,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:51,334 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-01-20 10:06:51,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:06:51,334 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-01-20 10:06:51,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:51,336 INFO L225 Difference]: With dead ends: 363 [2019-01-20 10:06:51,337 INFO L226 Difference]: Without dead ends: 362 [2019-01-20 10:06:51,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:06:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-20 10:06:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-01-20 10:06:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-20 10:06:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-20 10:06:51,343 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-01-20 10:06:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:51,343 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-20 10:06:51,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-01-20 10:06:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-20 10:06:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-20 10:06:51,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:51,345 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-01-20 10:06:51,345 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:51,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:51,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-01-20 10:06:51,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:51,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:55,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:55,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:55,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:55,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,217 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:55,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:55,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:55,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-01-20 10:06:55,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:55,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:55,827 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-20 10:06:55,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,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-20 10:06:55,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:00,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:00,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:05,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:05,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-01-20 10:07:05,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:05,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-01-20 10:07:05,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-01-20 10:07:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:07:05,163 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-01-20 10:07:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:05,923 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-01-20 10:07:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:07:05,923 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-01-20 10:07:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:05,925 INFO L225 Difference]: With dead ends: 367 [2019-01-20 10:07:05,926 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:07:05,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:07:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:07:05,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-01-20 10:07:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-20 10:07:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-01-20 10:07:05,932 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-01-20 10:07:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:05,933 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-01-20 10:07:05,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-01-20 10:07:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-01-20 10:07:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-20 10:07:05,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:05,934 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-01-20 10:07:05,934 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:05,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-01-20 10:07:05,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:05,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:05,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:09,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:09,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:09,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:09,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,984 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:09,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:09,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:10,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:10,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:10,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:10,115 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-20 10:07:10,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,125 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-20 10:07:10,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:14,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:19,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:19,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-01-20 10:07:19,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:19,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-01-20 10:07:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-01-20 10:07:19,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:07:19,048 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-01-20 10:07:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:19,759 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-20 10:07:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:07:19,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-01-20 10:07:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:19,761 INFO L225 Difference]: With dead ends: 371 [2019-01-20 10:07:19,762 INFO L226 Difference]: Without dead ends: 370 [2019-01-20 10:07:19,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-20 10:07:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-20 10:07:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-01-20 10:07:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-20 10:07:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-01-20 10:07:19,768 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-01-20 10:07:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:19,769 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-01-20 10:07:19,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-01-20 10:07:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-01-20 10:07:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-01-20 10:07:19,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:19,770 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-01-20 10:07:19,770 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-01-20 10:07:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:19,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:19,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:23,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:23,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:23,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:23,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,893 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:23,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:23,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:24,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:24,014 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-20 10:07:24,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:24,026 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-20 10:07:24,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:28,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-01-20 10:07:33,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-01-20 10:07:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-01-20 10:07:33,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:07:33,361 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-01-20 10:07:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:34,119 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-20 10:07:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:07:34,120 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-01-20 10:07:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:34,122 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:07:34,122 INFO L226 Difference]: Without dead ends: 374 [2019-01-20 10:07:34,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:07:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-20 10:07:34,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-01-20 10:07:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-01-20 10:07:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-01-20 10:07:34,129 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-01-20 10:07:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:34,129 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-01-20 10:07:34,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-01-20 10:07:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-01-20 10:07:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-01-20 10:07:34,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:34,131 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-01-20 10:07:34,131 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-01-20 10:07:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:34,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:38,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:38,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:38,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:38,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:38,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:38,063 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:38,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:38,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:38,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-20 10:07:38,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:38,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:38,699 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-20 10:07:38,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,710 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-20 10:07:38,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:43,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-01-20 10:07:47,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:47,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-01-20 10:07:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-01-20 10:07:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-20 10:07:47,966 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-01-20 10:07:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:48,756 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-01-20 10:07:48,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:07:48,757 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-01-20 10:07:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:48,758 INFO L225 Difference]: With dead ends: 379 [2019-01-20 10:07:48,758 INFO L226 Difference]: Without dead ends: 378 [2019-01-20 10:07:48,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-20 10:07:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-20 10:07:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-01-20 10:07:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-20 10:07:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-20 10:07:48,765 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-01-20 10:07:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:48,765 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-20 10:07:48,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-01-20 10:07:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-20 10:07:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-20 10:07:48,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:48,766 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-01-20 10:07:48,767 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:48,767 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-01-20 10:07:48,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:48,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:48,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:48,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:52,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:52,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:52,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:52,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:52,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:52,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:52,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:53,019 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:53,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:53,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:53,036 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-20 10:07:53,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:53,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:53,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:58,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:02,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:02,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-01-20 10:08:02,733 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:02,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-01-20 10:08:02,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-01-20 10:08:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:08:02,736 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-01-20 10:08:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:03,448 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-01-20 10:08:03,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:08:03,449 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-01-20 10:08:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:03,450 INFO L225 Difference]: With dead ends: 383 [2019-01-20 10:08:03,450 INFO L226 Difference]: Without dead ends: 382 [2019-01-20 10:08:03,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:08:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-20 10:08:03,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-01-20 10:08:03,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-20 10:08:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-20 10:08:03,457 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-01-20 10:08:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:03,457 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-20 10:08:03,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-01-20 10:08:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-20 10:08:03,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-20 10:08:03,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:03,458 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-01-20 10:08:03,459 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:03,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:03,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-01-20 10:08:03,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:03,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:03,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:03,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:03,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:07,694 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-20 10:08:07,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:07,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:07,695 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:07,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:07,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:07,695 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:07,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:07,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:07,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:07,810 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-20 10:08:07,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:07,818 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-20 10:08:07,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:13,008 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-20 10:08:13,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:17,546 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-20 10:08:17,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:17,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-01-20 10:08:17,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:17,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-01-20 10:08:17,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-01-20 10:08:17,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-20 10:08:17,569 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-01-20 10:08:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:18,396 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-01-20 10:08:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:08:18,397 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-01-20 10:08:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:18,399 INFO L225 Difference]: With dead ends: 387 [2019-01-20 10:08:18,399 INFO L226 Difference]: Without dead ends: 386 [2019-01-20 10:08:18,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-20 10:08:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-20 10:08:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-01-20 10:08:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-01-20 10:08:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-01-20 10:08:18,408 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-01-20 10:08:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:18,408 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-01-20 10:08:18,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-01-20 10:08:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-01-20 10:08:18,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-01-20 10:08:18,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:18,411 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-01-20 10:08:18,411 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-01-20 10:08:18,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:18,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:18,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:22,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:22,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:22,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:22,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:22,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:22,839 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:22,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:22,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:23,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-01-20 10:08:23,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:23,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:23,524 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-20 10:08:23,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:23,532 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-20 10:08:23,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:28,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:33,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:33,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-01-20 10:08:33,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:33,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-01-20 10:08:33,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-01-20 10:08:33,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:08:33,596 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-01-20 10:08:34,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:34,472 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-20 10:08:34,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:08:34,472 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-01-20 10:08:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:34,474 INFO L225 Difference]: With dead ends: 391 [2019-01-20 10:08:34,474 INFO L226 Difference]: Without dead ends: 390 [2019-01-20 10:08:34,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:08:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-20 10:08:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-01-20 10:08:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-20 10:08:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-01-20 10:08:34,480 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-01-20 10:08:34,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:34,480 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-01-20 10:08:34,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-01-20 10:08:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-01-20 10:08:34,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-01-20 10:08:34,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:34,483 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-01-20 10:08:34,483 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:34,483 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-01-20 10:08:34,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:34,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:34,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:34,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:38,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:38,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:38,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:38,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:38,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:38,820 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:38,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:38,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:38,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:38,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:38,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:38,964 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-20 10:08:38,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,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-20 10:08:38,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:44,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:48,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:48,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-01-20 10:08:48,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:49,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-01-20 10:08:49,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-01-20 10:08:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:08:49,002 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-01-20 10:08:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:49,859 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-20 10:08:49,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:08:49,859 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-01-20 10:08:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:49,861 INFO L225 Difference]: With dead ends: 395 [2019-01-20 10:08:49,861 INFO L226 Difference]: Without dead ends: 394 [2019-01-20 10:08:49,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-20 10:08:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-20 10:08:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-01-20 10:08:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-20 10:08:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-01-20 10:08:49,869 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-01-20 10:08:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:49,869 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-01-20 10:08:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-01-20 10:08:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-01-20 10:08:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-20 10:08:49,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:49,870 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-01-20 10:08:49,871 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-01-20 10:08:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:49,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:49,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:49,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:49,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:54,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:54,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:54,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:54,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:54,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:54,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:54,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:54,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:54,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:54,529 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-20 10:08:54,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:54,539 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-20 10:08:54,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:00,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-01-20 10:09:04,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-01-20 10:09:04,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-01-20 10:09:04,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:09:04,697 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-01-20 10:09:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:05,495 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-01-20 10:09:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:09:05,495 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-01-20 10:09:05,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:05,497 INFO L225 Difference]: With dead ends: 399 [2019-01-20 10:09:05,497 INFO L226 Difference]: Without dead ends: 398 [2019-01-20 10:09:05,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:09:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-01-20 10:09:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-01-20 10:09:05,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-20 10:09:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-20 10:09:05,504 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-01-20 10:09:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:05,504 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-20 10:09:05,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-01-20 10:09:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-20 10:09:05,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-20 10:09:05,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:05,506 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-01-20 10:09:05,506 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:05,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-01-20 10:09:05,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:05,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:05,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:05,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:09,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:09,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:09,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:09,928 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:09,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:10,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-01-20 10:09:10,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:10,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:10,642 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-20 10:09:10,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:10,658 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-20 10:09:10,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:16,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:20,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-01-20 10:09:20,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:20,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-01-20 10:09:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-01-20 10:09:20,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:09:20,952 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-01-20 10:09:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:21,785 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-01-20 10:09:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:09:21,786 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-01-20 10:09:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:21,788 INFO L225 Difference]: With dead ends: 403 [2019-01-20 10:09:21,788 INFO L226 Difference]: Without dead ends: 402 [2019-01-20 10:09:21,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-20 10:09:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-20 10:09:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-01-20 10:09:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-20 10:09:21,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-20 10:09:21,794 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-01-20 10:09:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:21,795 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-20 10:09:21,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-01-20 10:09:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-20 10:09:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-20 10:09:21,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:21,797 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-01-20 10:09:21,797 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:21,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-01-20 10:09:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:21,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:26,647 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:26,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:26,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:26,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:26,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:26,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:26,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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:26,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:26,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:26,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:26,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:26,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:26,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-20 10:09:26,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:26,843 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-20 10:09:26,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:32,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:37,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:37,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-01-20 10:09:37,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:37,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-01-20 10:09:37,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-01-20 10:09:37,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:09:37,043 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-01-20 10:09:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:37,909 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-01-20 10:09:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:09:37,910 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-01-20 10:09:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:37,912 INFO L225 Difference]: With dead ends: 407 [2019-01-20 10:09:37,912 INFO L226 Difference]: Without dead ends: 406 [2019-01-20 10:09:37,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:09:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-20 10:09:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-01-20 10:09:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-20 10:09:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-01-20 10:09:37,919 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-01-20 10:09:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:37,920 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-01-20 10:09:37,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-01-20 10:09:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-01-20 10:09:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-01-20 10:09:37,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:37,922 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-01-20 10:09:37,922 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:37,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-01-20 10:09:37,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:42,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:42,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:42,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:42,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:42,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:42,683 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:42,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:42,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:42,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:47,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:47,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-01-20 10:09:47,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:47,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:09:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:09:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-01-20 10:09:47,776 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-01-20 10:09:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:49,236 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-01-20 10:09:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:09:49,236 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-01-20 10:09:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:49,237 INFO L225 Difference]: With dead ends: 408 [2019-01-20 10:09:49,238 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:09:49,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:09:49,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:09:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:09:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:09:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:09:49,242 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-01-20 10:09:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:49,242 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:09:49,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:09:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:09:49,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:09:49,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:09:49,355 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-01-20 10:09:52,375 WARN L181 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-01-20 10:09:52,382 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-01-20 10:09:52,382 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-01-20 10:09:52,382 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-20 10:09:52,382 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-01-20 10:09:52,382 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-01-20 10:09:52,385 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-01-20 10:09:52,385 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-01-20 10:09:52,385 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-01-20 10:09:52,436 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:09:52 BoogieIcfgContainer [2019-01-20 10:09:52,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:09:52,437 INFO L168 Benchmark]: Toolchain (without parser) took 734615.06 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 105.7 MB in the beginning and 1.1 GB in the end (delta: -964.3 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-20 10:09:52,438 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:09:52,438 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-01-20 10:09:52,438 INFO L168 Benchmark]: Boogie Preprocessor took 28.41 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:09:52,439 INFO L168 Benchmark]: RCFGBuilder took 386.67 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:09:52,439 INFO L168 Benchmark]: TraceAbstraction took 734133.49 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 91.9 MB in the beginning and 1.1 GB in the end (delta: -978.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-20 10:09:52,441 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 138.4 MB. Free memory was 105.7 MB in the beginning and 103.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.41 ms. Allocated memory is still 138.4 MB. Free memory was 103.4 MB in the beginning and 102.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 386.67 ms. Allocated memory is still 138.4 MB. Free memory was 102.2 MB in the beginning and 92.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 734133.49 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 91.9 MB in the beginning and 1.1 GB in the end (delta: -978.0 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 733.9s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 44.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 626.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.1s SsaConstructionTime, 14.3s SatisfiabilityAnalysisTime, 659.3s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...