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-1de736e-m [2019-02-18 09:26:03,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:26:03,737 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:26:03,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:26:03,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:26:03,759 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:26:03,762 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:26:03,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:26:03,770 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:26:03,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:26:03,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:26:03,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:26:03,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:26:03,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:26:03,777 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:26:03,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:26:03,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:26:03,780 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:26:03,782 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:26:03,784 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:26:03,785 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:26:03,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:26:03,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:26:03,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:26:03,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:26:03,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:26:03,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:26:03,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:26:03,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:26:03,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:26:03,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:26:03,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:26:03,795 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:26:03,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:26:03,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:26:03,797 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:26:03,797 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-02-18 09:26:03,810 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:26:03,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:26:03,811 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:26:03,811 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:26:03,811 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:26:03,811 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:26:03,812 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:26:03,812 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:26:03,812 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:26:03,812 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:26:03,812 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:26:03,813 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:26:03,813 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:26:03,813 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:26:03,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:26:03,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:26:03,814 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:26:03,814 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:26:03,814 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:26:03,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:26:03,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:26:03,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:26:03,815 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:26:03,815 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:26:03,816 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:26:03,816 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:26:03,816 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:26:03,816 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:26:03,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:26:03,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:26:03,817 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:26:03,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:26:03,817 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:26:03,817 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:26:03,817 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:26:03,818 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:26:03,818 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:26:03,818 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:26:03,818 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:26:03,818 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:26:03,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:26:03,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:26:03,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:26:03,877 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:26:03,877 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:26:03,878 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-02-18 09:26:03,878 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-02-18 09:26:03,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:26:03,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:26:03,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:26:03,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:26:03,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:26:03,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:03,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:03,977 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:26:03,978 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:26:03,978 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:26:03,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:26:03,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:26:03,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:26:03,999 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:26:04,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,012 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/1) ... [2019-02-18 09:26:04,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:26:04,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:26:04,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:26:04,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:26:04,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:26:04,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:26:04,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:26:04,094 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-18 09:26:04,353 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:26:04,356 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-18 09:26:04,358 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:26:04 BoogieIcfgContainer [2019-02-18 09:26:04,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:26:04,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:26:04,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:26:04,367 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:26:04,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:26:03" (1/2) ... [2019-02-18 09:26:04,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222132cf and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:26:04, skipping insertion in model container [2019-02-18 09:26:04,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:26:04" (2/2) ... [2019-02-18 09:26:04,377 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-02-18 09:26:04,396 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:26:04,406 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:26:04,435 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:26:04,488 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:26:04,488 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:26:04,488 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:26:04,489 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:26:04,489 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:26:04,489 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:26:04,489 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:26:04,489 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:26:04,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-02-18 09:26:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:26:04,511 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:04,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:26:04,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:04,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-02-18 09:26:04,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:04,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:26:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:26:04,722 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:26:04,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:26:04,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:26:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:26:04,738 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-02-18 09:26:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:04,832 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-02-18 09:26:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:26:04,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:26:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:04,849 INFO L225 Difference]: With dead ends: 17 [2019-02-18 09:26:04,849 INFO L226 Difference]: Without dead ends: 10 [2019-02-18 09:26:04,855 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-02-18 09:26:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-18 09:26:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-02-18 09:26:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:26:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-18 09:26:04,890 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-02-18 09:26:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:04,890 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-18 09:26:04,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:26:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-18 09:26:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:26:04,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:04,892 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-18 09:26:04,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:04,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-02-18 09:26:04,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:05,006 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 09:26:05,009 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-02-18 09:26:05,059 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:26:05,059 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:26:05,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:26:05,190 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-02-18 09:26:05,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:05,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:26:05,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:05,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:05,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:05,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:05,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:05,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:05,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:05,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:26:05,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:05,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:26:05,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:26:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:26:05,694 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-02-18 09:26:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:05,826 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-18 09:26:05,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:26:05,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-02-18 09:26:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:05,827 INFO L225 Difference]: With dead ends: 15 [2019-02-18 09:26:05,827 INFO L226 Difference]: Without dead ends: 14 [2019-02-18 09:26:05,829 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-02-18 09:26:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-18 09:26:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-18 09:26:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:26:05,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-18 09:26:05,833 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-02-18 09:26:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:05,834 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-18 09:26:05,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:26:05,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-18 09:26:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:26:05,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:05,835 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-02-18 09:26:05,835 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:05,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-02-18 09:26:05,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:05,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:05,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:05,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:05,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:05,935 INFO 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-02-18 09:26:05,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:05,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:06,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:26:06,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:06,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:06,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-02-18 09:26:06,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:06,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:26:06,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:06,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:26:06,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:26:06,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:26:06,345 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-02-18 09:26:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:06,485 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-18 09:26:06,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:26:06,486 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-02-18 09:26:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:06,488 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:26:06,488 INFO L226 Difference]: Without dead ends: 18 [2019-02-18 09:26:06,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:26:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-18 09:26:06,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-02-18 09:26:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:26:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-18 09:26:06,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-02-18 09:26:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:06,493 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-18 09:26:06,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:26:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-18 09:26:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:26:06,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:06,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-02-18 09:26:06,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-02-18 09:26:06,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:06,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:06,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:06,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:06,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:06,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:06,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:06,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:06,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:06,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:06,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:06,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:06,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 09:26:06,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:06,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:26:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:26:06,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:26:06,922 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-18 09:26:07,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:07,268 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-18 09:26:07,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:26:07,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-18 09:26:07,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:07,270 INFO L225 Difference]: With dead ends: 23 [2019-02-18 09:26:07,270 INFO L226 Difference]: Without dead ends: 22 [2019-02-18 09:26:07,271 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-02-18 09:26:07,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-18 09:26:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-18 09:26:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:26:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-18 09:26:07,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-02-18 09:26:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:07,277 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-18 09:26:07,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:26:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-18 09:26:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:26:07,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:07,278 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-02-18 09:26:07,278 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:07,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-02-18 09:26:07,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:07,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:07,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:07,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:07,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:07,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,416 INFO 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-02-18 09:26:07,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:07,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:07,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:07,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:07,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:07,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 09:26:07,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:26:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:26:07,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:26:07,733 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-02-18 09:26:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:07,824 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-18 09:26:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:26:07,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-02-18 09:26:07,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:07,825 INFO L225 Difference]: With dead ends: 27 [2019-02-18 09:26:07,825 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:26:07,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:26:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:26:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-18 09:26:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:26:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-18 09:26:07,831 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-02-18 09:26:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:07,831 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-18 09:26:07,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:26:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-18 09:26:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:26:07,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:07,833 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-02-18 09:26:07,833 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:07,833 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-02-18 09:26:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:07,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:07,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:07,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:07,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:07,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,961 INFO 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-02-18 09:26:07,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:07,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:07,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:26:07,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:07,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:07,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:07,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:08,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-18 09:26:08,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:08,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:26:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:26:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:26:08,373 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-02-18 09:26:08,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:08,422 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-18 09:26:08,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:26:08,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-02-18 09:26:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:08,424 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:26:08,425 INFO L226 Difference]: Without dead ends: 30 [2019-02-18 09:26:08,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:26:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-18 09:26:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-02-18 09:26:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:26:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-18 09:26:08,431 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-02-18 09:26:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:08,432 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-18 09:26:08,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:26:08,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-18 09:26:08,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:26:08,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:08,433 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-02-18 09:26:08,433 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-02-18 09:26:08,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:08,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:08,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:08,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:08,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:08,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,661 INFO 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-02-18 09:26:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:08,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:08,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:08,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:08,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:08,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:08,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:08,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-18 09:26:08,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:08,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:26:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:26:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:26:08,984 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-02-18 09:26:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:09,108 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-18 09:26:09,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:26:09,110 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-02-18 09:26:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:09,112 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:26:09,112 INFO L226 Difference]: Without dead ends: 34 [2019-02-18 09:26:09,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:26:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-18 09:26:09,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-02-18 09:26:09,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:26:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-18 09:26:09,117 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-02-18 09:26:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:09,117 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-18 09:26:09,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:26:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-18 09:26:09,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:26:09,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:09,118 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-02-18 09:26:09,119 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:09,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:09,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-02-18 09:26:09,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:09,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:09,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:09,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:09,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:09,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:09,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:09,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 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-02-18 09:26:09,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:09,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:09,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:09,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:09,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:09,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:09,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:09,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-18 09:26:09,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:09,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:26:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:26:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:26:09,876 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-02-18 09:26:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:10,079 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-18 09:26:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:26:10,081 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-02-18 09:26:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:10,082 INFO L225 Difference]: With dead ends: 39 [2019-02-18 09:26:10,083 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 09:26:10,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:26:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 09:26:10,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-18 09:26:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:26:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-18 09:26:10,088 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-02-18 09:26:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:10,089 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-18 09:26:10,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:26:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-18 09:26:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:26:10,090 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:10,090 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-02-18 09:26:10,090 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-02-18 09:26:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:10,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:10,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:10,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:10,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:10,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:10,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:10,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:26:10,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:10,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:10,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:10,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-18 09:26:11,043 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:11,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:26:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:26:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:26:11,044 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-02-18 09:26:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:11,162 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-18 09:26:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:26:11,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-02-18 09:26:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:11,164 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:26:11,164 INFO L226 Difference]: Without dead ends: 42 [2019-02-18 09:26:11,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:26:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-18 09:26:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-02-18 09:26:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:26:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-18 09:26:11,170 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-02-18 09:26:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:11,171 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-18 09:26:11,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:26:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-18 09:26:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:26:11,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:11,172 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-02-18 09:26:11,172 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:11,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-02-18 09:26:11,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:11,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:11,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:11,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:11,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:11,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:11,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:11,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:11,440 INFO 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-02-18 09:26:11,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:11,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:11,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:11,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:11,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:11,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:11,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:11,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:11,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:12,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:12,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-18 09:26:12,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:12,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:26:12,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:26:12,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:26:12,084 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-02-18 09:26:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:12,169 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-18 09:26:12,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:26:12,170 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-02-18 09:26:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:12,171 INFO L225 Difference]: With dead ends: 47 [2019-02-18 09:26:12,171 INFO L226 Difference]: Without dead ends: 46 [2019-02-18 09:26:12,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:26:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-18 09:26:12,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-02-18 09:26:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:26:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-18 09:26:12,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-02-18 09:26:12,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:12,178 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-18 09:26:12,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:26:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-18 09:26:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:26:12,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:12,179 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-02-18 09:26:12,180 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-02-18 09:26:12,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:12,572 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:12,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:12,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:12,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:12,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,573 INFO 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-02-18 09:26:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:12,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:12,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:12,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:12,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:12,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-02-18 09:26:12,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:12,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:13,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-18 09:26:13,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:13,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:26:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:26:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:26:13,221 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-02-18 09:26:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:13,312 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-18 09:26:13,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:26:13,312 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-02-18 09:26:13,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:13,314 INFO L225 Difference]: With dead ends: 51 [2019-02-18 09:26:13,314 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:26:13,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:26:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:26:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-18 09:26:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:26:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-18 09:26:13,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-02-18 09:26:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:13,321 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-18 09:26:13,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:26:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-18 09:26:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:26:13,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:13,322 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-02-18 09:26:13,322 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:13,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-02-18 09:26:13,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:13,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:13,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:13,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:13,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:13,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:13,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:13,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:13,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-18 09:26:13,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:13,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:13,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:13,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:13,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:14,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:14,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-18 09:26:14,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:14,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:26:14,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:26:14,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:14,477 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-02-18 09:26:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:14,599 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-18 09:26:14,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:26:14,599 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-02-18 09:26:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:14,600 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:26:14,600 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:26:14,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:26:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-02-18 09:26:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:26:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-18 09:26:14,607 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-02-18 09:26:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:14,607 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-18 09:26:14,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:26:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-18 09:26:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:26:14,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:14,608 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-02-18 09:26:14,608 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-02-18 09:26:14,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:14,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:14,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:15,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:15,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:15,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:15,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:15,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:15,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:15,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:15,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:15,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:15,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:15,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:15,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:15,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:15,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:15,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:15,830 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:15,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:15,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-18 09:26:15,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:15,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:26:15,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:26:15,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-18 09:26:15,851 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-02-18 09:26:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:15,951 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-18 09:26:15,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:26:15,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-02-18 09:26:15,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:15,952 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:26:15,952 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:26:15,954 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-02-18 09:26:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:26:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-02-18 09:26:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:26:15,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-18 09:26:15,959 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-02-18 09:26:15,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:15,960 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-18 09:26:15,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:26:15,960 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-18 09:26:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:26:15,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:15,961 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-02-18 09:26:15,961 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:15,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-02-18 09:26:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:16,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:16,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:16,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,917 INFO 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-02-18 09:26:16,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:16,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:16,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:16,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:16,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:17,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:18,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:18,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-18 09:26:18,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:18,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:26:18,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:26:18,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:18,237 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-02-18 09:26:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:18,434 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-18 09:26:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:26:18,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-02-18 09:26:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:18,436 INFO L225 Difference]: With dead ends: 63 [2019-02-18 09:26:18,436 INFO L226 Difference]: Without dead ends: 62 [2019-02-18 09:26:18,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:18,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-18 09:26:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-18 09:26:18,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:26:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-18 09:26:18,443 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-02-18 09:26:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:18,444 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-18 09:26:18,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:26:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-18 09:26:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:26:18,445 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:18,445 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-02-18 09:26:18,445 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:18,446 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-02-18 09:26:18,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:18,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:18,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:18,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:18,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:18,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:18,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:18,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:18,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:18,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:18,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:26:18,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:18,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:18,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-02-18 09:26:18,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:18,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:18,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:20,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:20,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-18 09:26:20,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:20,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:26:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:26:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:26:20,187 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-02-18 09:26:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:20,411 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-18 09:26:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:26:20,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-02-18 09:26:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:20,413 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:26:20,413 INFO L226 Difference]: Without dead ends: 66 [2019-02-18 09:26:20,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:26:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-18 09:26:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-02-18 09:26:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:26:20,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-18 09:26:20,420 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-02-18 09:26:20,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:20,420 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-18 09:26:20,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:26:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-18 09:26:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:26:20,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:20,421 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-02-18 09:26:20,422 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:20,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:20,422 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-02-18 09:26:20,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:20,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:20,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:20,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:20,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:20,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:20,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:20,848 INFO 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-02-18 09:26:20,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:20,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:20,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:20,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:20,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:20,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-02-18 09:26:20,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:20,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:20,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:21,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-18 09:26:21,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:21,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:26:21,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:26:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:21,634 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-02-18 09:26:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:21,775 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-18 09:26:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:26:21,776 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-02-18 09:26:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:21,776 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:26:21,777 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:26:21,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:21,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:26:21,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-02-18 09:26:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:26:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-18 09:26:21,783 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-02-18 09:26:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:21,784 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-18 09:26:21,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:26:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-18 09:26:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:26:21,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:21,785 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-02-18 09:26:21,785 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:21,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-02-18 09:26:21,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:21,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:21,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:22,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:22,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:22,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:22,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:22,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:22,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:22,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:22,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-02-18 09:26:22,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:22,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:22,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:23,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:24,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-18 09:26:24,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:24,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:26:24,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:26:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:26:24,215 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-02-18 09:26:24,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:24,327 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-18 09:26:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:26:24,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-02-18 09:26:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:24,328 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:26:24,328 INFO L226 Difference]: Without dead ends: 74 [2019-02-18 09:26:24,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:26:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-18 09:26:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-18 09:26:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:26:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-18 09:26:24,336 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-02-18 09:26:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:24,336 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-18 09:26:24,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:26:24,336 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-18 09:26:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:26:24,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:24,338 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-02-18 09:26:24,338 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-02-18 09:26:24,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:24,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:24,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:24,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:24,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:24,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:24,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:24,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:24,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:24,905 INFO 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-02-18 09:26:24,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:24,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:24,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:26:24,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:24,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:24,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:24,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:24,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:25,323 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:25,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:25,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-18 09:26:25,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:25,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:26:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:26:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:25,926 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-02-18 09:26:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:26,046 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-18 09:26:26,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:26:26,046 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-02-18 09:26:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:26,047 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:26:26,047 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 09:26:26,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 09:26:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-02-18 09:26:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:26:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-18 09:26:26,053 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-02-18 09:26:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:26,053 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-18 09:26:26,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:26:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-18 09:26:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:26:26,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:26,054 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-02-18 09:26:26,055 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-02-18 09:26:26,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:26,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:26,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:26,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:26,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:26,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:26,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:26,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:26,851 INFO 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-02-18 09:26:26,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:26,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:26,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:26,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:26,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:26,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:26,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:26,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:26,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:28,103 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:28,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:28,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-18 09:26:28,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:28,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:26:28,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:26:28,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:26:28,124 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-02-18 09:26:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:28,291 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-18 09:26:28,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:26:28,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-02-18 09:26:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:28,292 INFO L225 Difference]: With dead ends: 83 [2019-02-18 09:26:28,292 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 09:26:28,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:26:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 09:26:28,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-02-18 09:26:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:26:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-18 09:26:28,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-02-18 09:26:28,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:28,298 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-18 09:26:28,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:26:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-18 09:26:28,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:26:28,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:28,299 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-02-18 09:26:28,299 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:28,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:28,300 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-02-18 09:26:28,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:28,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:28,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:28,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:28,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:28,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:28,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:28,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:28,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:28,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:28,739 INFO 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-02-18 09:26:28,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:28,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:28,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:28,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-02-18 09:26:28,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:28,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:28,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:29,148 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:29,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:30,073 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:30,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:30,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-18 09:26:30,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:30,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:26:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:26:30,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:30,094 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-02-18 09:26:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:30,241 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-18 09:26:30,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:26:30,241 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-02-18 09:26:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:30,242 INFO L225 Difference]: With dead ends: 87 [2019-02-18 09:26:30,243 INFO L226 Difference]: Without dead ends: 86 [2019-02-18 09:26:30,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-18 09:26:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-18 09:26:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:26:30,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-18 09:26:30,249 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-02-18 09:26:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:30,249 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-18 09:26:30,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:26:30,249 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-18 09:26:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:26:30,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:30,251 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-02-18 09:26:30,251 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:30,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-02-18 09:26:30,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:30,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:30,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:30,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:30,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:30,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:30,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:30,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,888 INFO 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-02-18 09:26:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:30,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:30,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-18 09:26:30,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:30,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:30,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:30,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:30,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:30,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:31,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:32,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:32,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-18 09:26:32,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:32,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:26:32,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:26:32,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:26:32,247 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-02-18 09:26:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:32,428 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-18 09:26:32,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:26:32,429 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-02-18 09:26:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:32,430 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:26:32,430 INFO L226 Difference]: Without dead ends: 90 [2019-02-18 09:26:32,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:26:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-18 09:26:32,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-02-18 09:26:32,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:26:32,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-18 09:26:32,435 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-02-18 09:26:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:32,435 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-18 09:26:32,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:26:32,435 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-18 09:26:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:26:32,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:32,436 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-02-18 09:26:32,436 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:32,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-02-18 09:26:32,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:32,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:32,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:32,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:32,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:32,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,871 INFO 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-02-18 09:26:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:32,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:32,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:32,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:32,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:32,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:32,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:33,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:33,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:33,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:34,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:34,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-18 09:26:34,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:34,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:26:34,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:26:34,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:34,294 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-02-18 09:26:34,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:34,486 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-18 09:26:34,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:26:34,490 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-02-18 09:26:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:34,491 INFO L225 Difference]: With dead ends: 95 [2019-02-18 09:26:34,491 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:26:34,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:26:34,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-02-18 09:26:34,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:26:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-18 09:26:34,495 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-02-18 09:26:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:34,496 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-18 09:26:34,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:26:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-18 09:26:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:26:34,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:34,497 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-02-18 09:26:34,497 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:34,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-02-18 09:26:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:34,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:34,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:35,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:35,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:35,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:35,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:35,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:35,297 INFO 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-02-18 09:26:35,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:35,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:35,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:35,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:35,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:35,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:35,786 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:35,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:36,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-18 09:26:36,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:36,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:26:36,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:26:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:26:36,810 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-02-18 09:26:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:36,981 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-18 09:26:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:26:36,983 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-02-18 09:26:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:36,984 INFO L225 Difference]: With dead ends: 99 [2019-02-18 09:26:36,984 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 09:26:36,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:26:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 09:26:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-18 09:26:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:26:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-18 09:26:36,990 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-02-18 09:26:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:36,990 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-18 09:26:36,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:26:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-18 09:26:36,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:26:36,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:36,991 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-02-18 09:26:36,991 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:36,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-02-18 09:26:36,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:36,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:37,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:37,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:37,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:37,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:37,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:37,682 INFO 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-02-18 09:26:37,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:37,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:37,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:26:37,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:37,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:37,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-02-18 09:26:37,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:37,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:37,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:38,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:39,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:39,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-18 09:26:39,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:39,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:26:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:26:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:39,531 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-02-18 09:26:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:39,785 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-18 09:26:39,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:26:39,788 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-02-18 09:26:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:39,789 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:26:39,789 INFO L226 Difference]: Without dead ends: 102 [2019-02-18 09:26:39,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-18 09:26:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-02-18 09:26:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:26:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-18 09:26:39,795 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-02-18 09:26:39,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:39,796 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-18 09:26:39,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:26:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-18 09:26:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:26:39,796 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:39,797 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-02-18 09:26:39,797 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-02-18 09:26:39,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:39,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:39,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:39,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:39,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:40,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:40,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:40,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:40,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:40,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:40,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:40,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:40,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:40,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:40,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:40,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:40,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:40,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:40,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:40,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:41,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:42,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:42,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-18 09:26:42,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:42,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:26:42,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:26:42,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:26:42,270 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-02-18 09:26:42,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:42,469 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-18 09:26:42,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:26:42,469 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-02-18 09:26:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:42,470 INFO L225 Difference]: With dead ends: 107 [2019-02-18 09:26:42,470 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 09:26:42,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:26:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 09:26:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-02-18 09:26:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:26:42,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-18 09:26:42,475 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-02-18 09:26:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:42,476 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-18 09:26:42,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:26:42,476 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-18 09:26:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:26:42,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:42,477 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-02-18 09:26:42,477 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:42,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:42,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-02-18 09:26:42,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:42,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:43,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:43,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:43,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:43,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:43,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:43,007 INFO 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-02-18 09:26:43,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:43,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:43,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:43,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:43,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:43,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:43,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:43,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:44,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:44,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-18 09:26:44,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:44,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:26:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:26:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:44,910 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-02-18 09:26:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:45,167 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-18 09:26:45,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:26:45,168 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-02-18 09:26:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:45,168 INFO L225 Difference]: With dead ends: 111 [2019-02-18 09:26:45,168 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:26:45,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:26:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-18 09:26:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:26:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-18 09:26:45,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-02-18 09:26:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:45,174 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-18 09:26:45,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:26:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-18 09:26:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:26:45,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:45,175 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-02-18 09:26:45,175 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:45,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-02-18 09:26:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:45,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:45,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:45,819 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:45,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:45,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 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-02-18 09:26:45,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:45,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:45,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:26:45,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:45,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:45,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:45,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:45,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:45,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:46,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:47,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:47,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-18 09:26:47,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:47,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:26:47,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:26:47,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-18 09:26:47,815 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-02-18 09:26:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:48,010 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-18 09:26:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:26:48,011 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-02-18 09:26:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:48,012 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:26:48,013 INFO L226 Difference]: Without dead ends: 114 [2019-02-18 09:26:48,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-18 09:26:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-18 09:26:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-02-18 09:26:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:26:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-18 09:26:48,019 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-02-18 09:26:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:48,019 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-18 09:26:48,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:26:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-18 09:26:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 09:26:48,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:48,020 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-02-18 09:26:48,020 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:48,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-02-18 09:26:48,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:48,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:48,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:48,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:48,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:48,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:48,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:48,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:48,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:48,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:48,749 INFO 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-02-18 09:26:48,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:48,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:48,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:48,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:48,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:48,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:48,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:48,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:48,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:49,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:51,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:51,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-18 09:26:51,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:51,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:26:51,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:26:51,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:51,202 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-02-18 09:26:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:51,405 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-02-18 09:26:51,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:26:51,406 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-02-18 09:26:51,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:51,407 INFO L225 Difference]: With dead ends: 119 [2019-02-18 09:26:51,407 INFO L226 Difference]: Without dead ends: 118 [2019-02-18 09:26:51,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:51,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-02-18 09:26:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-02-18 09:26:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:26:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-18 09:26:51,411 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-02-18 09:26:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:51,412 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-18 09:26:51,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:26:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-18 09:26:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-18 09:26:51,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:51,412 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-02-18 09:26:51,412 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-02-18 09:26:51,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:52,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:52,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:52,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:52,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:52,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:52,190 INFO 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-02-18 09:26:52,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:52,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:52,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:52,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:52,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:52,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:52,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:53,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:54,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-18 09:26:54,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:54,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:26:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:26:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:26:54,551 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-02-18 09:26:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:54,788 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-18 09:26:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:26:54,789 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-02-18 09:26:54,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:54,790 INFO L225 Difference]: With dead ends: 123 [2019-02-18 09:26:54,790 INFO L226 Difference]: Without dead ends: 122 [2019-02-18 09:26:54,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:26:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-18 09:26:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-18 09:26:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:26:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-18 09:26:54,796 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-02-18 09:26:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:54,796 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-18 09:26:54,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:26:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-18 09:26:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-18 09:26:54,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:54,797 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-02-18 09:26:54,798 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-02-18 09:26:54,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:54,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:54,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:54,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:54,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:55,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:55,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:55,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:55,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,733 INFO 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-02-18 09:26:55,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:55,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:55,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:26:55,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:55,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:55,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:55,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:55,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:55,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:56,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:58,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:58,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-18 09:26:58,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:58,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:26:58,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:26:58,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:26:58,201 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-02-18 09:26:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:58,431 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-02-18 09:26:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:26:58,432 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-02-18 09:26:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:58,433 INFO L225 Difference]: With dead ends: 127 [2019-02-18 09:26:58,434 INFO L226 Difference]: Without dead ends: 126 [2019-02-18 09:26:58,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:26:58,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-02-18 09:26:58,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-02-18 09:26:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-18 09:26:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-02-18 09:26:58,438 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-02-18 09:26:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:58,438 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-02-18 09:26:58,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:26:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-02-18 09:26:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-18 09:26:58,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:58,439 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-02-18 09:26:58,439 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:58,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:58,439 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-02-18 09:26:58,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:58,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:59,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:59,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:59,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:59,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:26:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:59,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:59,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:59,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:59,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:59,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:26:59,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:59,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:59,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:26:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:59,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:01,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:01,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-18 09:27:01,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:01,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:27:01,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:27:01,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:27:01,893 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-02-18 09:27:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:02,164 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-18 09:27:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:27:02,164 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-02-18 09:27:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:02,166 INFO L225 Difference]: With dead ends: 131 [2019-02-18 09:27:02,166 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 09:27:02,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:27:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 09:27:02,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-02-18 09:27:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:27:02,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-02-18 09:27:02,171 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-02-18 09:27:02,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:02,171 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-02-18 09:27:02,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:27:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-02-18 09:27:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:27:02,172 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:02,172 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-02-18 09:27:02,173 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:02,173 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-02-18 09:27:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:02,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:02,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:02,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:02,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:02,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:02,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:02,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:02,973 INFO 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-02-18 09:27:02,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:02,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:03,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:03,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:03,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:03,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:03,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:05,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-18 09:27:05,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:27:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:27:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:05,987 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-02-18 09:27:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:06,230 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-18 09:27:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:27:06,231 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-02-18 09:27:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:06,233 INFO L225 Difference]: With dead ends: 135 [2019-02-18 09:27:06,233 INFO L226 Difference]: Without dead ends: 134 [2019-02-18 09:27:06,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-18 09:27:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-18 09:27:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:27:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-18 09:27:06,239 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-02-18 09:27:06,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:06,239 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-18 09:27:06,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:27:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-18 09:27:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:27:06,240 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:06,240 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-02-18 09:27:06,241 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-02-18 09:27:06,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:06,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:06,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:06,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:07,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:07,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:07,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:07,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:07,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:27:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:07,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:08,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-18 09:27:08,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:08,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:08,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:08,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:08,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-02-18 09:27:08,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:09,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:11,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-18 09:27:11,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:11,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:27:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:27:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:27:11,419 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-02-18 09:27:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:11,657 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-02-18 09:27:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:27:11,657 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-02-18 09:27:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:11,659 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:27:11,659 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:27:11,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 09:27:11,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:27:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-02-18 09:27:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:27:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-18 09:27:11,664 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-02-18 09:27:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:11,665 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-18 09:27:11,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:27:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-18 09:27:11,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-18 09:27:11,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:11,666 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-02-18 09:27:11,666 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:11,666 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-02-18 09:27:11,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:11,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:11,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:11,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:13,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:13,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:13,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:13,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:13,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:13,138 INFO 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-02-18 09:27:13,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:13,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:13,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:13,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:13,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:13,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:13,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:13,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:13,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:14,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:16,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:16,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-18 09:27:16,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:16,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:27:17,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:27:17,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:17,000 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-02-18 09:27:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:17,316 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-02-18 09:27:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:27:17,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-02-18 09:27:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:17,318 INFO L225 Difference]: With dead ends: 143 [2019-02-18 09:27:17,318 INFO L226 Difference]: Without dead ends: 142 [2019-02-18 09:27:17,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-02-18 09:27:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-02-18 09:27:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:27:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-02-18 09:27:17,325 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-02-18 09:27:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:17,326 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-02-18 09:27:17,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:27:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-02-18 09:27:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-18 09:27:17,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:17,327 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-02-18 09:27:17,327 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-02-18 09:27:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:17,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:18,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:18,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:18,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:18,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,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 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-02-18 09:27:18,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:18,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:18,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:18,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:18,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:18,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:18,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:19,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:21,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:21,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-18 09:27:21,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:21,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:27:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:27:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:27:21,758 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-02-18 09:27:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:22,194 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-18 09:27:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:27:22,195 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-02-18 09:27:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:22,196 INFO L225 Difference]: With dead ends: 147 [2019-02-18 09:27:22,197 INFO L226 Difference]: Without dead ends: 146 [2019-02-18 09:27:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 09:27:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-18 09:27:22,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-18 09:27:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-18 09:27:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-18 09:27:22,203 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-02-18 09:27:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:22,203 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-18 09:27:22,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:27:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-18 09:27:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-18 09:27:22,204 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:22,204 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-02-18 09:27:22,204 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:22,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:22,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-02-18 09:27:22,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:22,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:22,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:23,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:23,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:23,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:23,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:23,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:23,211 INFO 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-02-18 09:27:23,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:23,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:23,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:27:23,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:23,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:23,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:23,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:23,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:23,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:24,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:26,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:26,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-18 09:27:26,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:26,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:27:26,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:27:26,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:26,902 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-02-18 09:27:27,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:27,414 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-18 09:27:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:27:27,414 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-02-18 09:27:27,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:27,416 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:27:27,416 INFO L226 Difference]: Without dead ends: 150 [2019-02-18 09:27:27,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-18 09:27:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-02-18 09:27:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:27:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-02-18 09:27:27,422 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-02-18 09:27:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:27,422 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-02-18 09:27:27,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:27:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-02-18 09:27:27,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-18 09:27:27,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:27,423 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-02-18 09:27:27,423 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:27,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:27,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-02-18 09:27:27,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:27,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:27,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:27,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:27,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:29,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:29,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:29,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:29,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:29,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:29,024 INFO 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-02-18 09:27:29,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:29,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:29,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:29,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:29,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:29,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:29,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:29,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:29,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:30,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:30,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-18 09:27:32,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:32,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:27:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:27:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:27:32,731 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-02-18 09:27:33,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:33,127 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-02-18 09:27:33,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:27:33,127 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-02-18 09:27:33,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:33,129 INFO L225 Difference]: With dead ends: 155 [2019-02-18 09:27:33,129 INFO L226 Difference]: Without dead ends: 154 [2019-02-18 09:27:33,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 09:27:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-18 09:27:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-02-18 09:27:33,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-18 09:27:33,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-02-18 09:27:33,135 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-02-18 09:27:33,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:33,135 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-02-18 09:27:33,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:27:33,135 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-02-18 09:27:33,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-18 09:27:33,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:33,136 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-02-18 09:27:33,137 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:33,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-02-18 09:27:33,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:33,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:33,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:33,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:34,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:34,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:34,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:34,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:34,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:34,175 INFO 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-02-18 09:27:34,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:34,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:34,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:34,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-02-18 09:27:34,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:34,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:34,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:35,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:38,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:38,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:38,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-18 09:27:38,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:38,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:27:38,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:27:38,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:27:38,520 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-02-18 09:27:38,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:38,824 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-18 09:27:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:27:38,825 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-02-18 09:27:38,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:38,826 INFO L225 Difference]: With dead ends: 159 [2019-02-18 09:27:38,826 INFO L226 Difference]: Without dead ends: 158 [2019-02-18 09:27:38,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:27:38,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-18 09:27:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-18 09:27:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:27:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-18 09:27:38,832 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-02-18 09:27:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:38,832 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-18 09:27:38,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:27:38,832 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-18 09:27:38,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:27:38,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:38,833 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-02-18 09:27:38,834 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:38,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:38,834 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-02-18 09:27:38,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:38,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:38,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:40,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:40,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:40,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:40,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:40,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:40,663 INFO 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-02-18 09:27:40,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:40,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:40,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-18 09:27:40,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:40,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:40,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:40,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:40,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:40,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:42,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:44,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:44,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-18 09:27:44,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:44,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:27:44,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:27:44,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:27:44,846 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-02-18 09:27:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:45,185 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-02-18 09:27:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:27:45,185 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-02-18 09:27:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:45,186 INFO L225 Difference]: With dead ends: 163 [2019-02-18 09:27:45,187 INFO L226 Difference]: Without dead ends: 162 [2019-02-18 09:27:45,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:27:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-18 09:27:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-02-18 09:27:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:27:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-02-18 09:27:45,193 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-02-18 09:27:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:45,193 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-02-18 09:27:45,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:27:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-02-18 09:27:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:27:45,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:45,194 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-02-18 09:27:45,195 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:45,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-02-18 09:27:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:45,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:45,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:46,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:46,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:46,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:46,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:46,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,872 INFO 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-02-18 09:27:46,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:46,946 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:46,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:46,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:46,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:46,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:46,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:46,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:48,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-18 09:27:50,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:50,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:27:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:27:50,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:27:50,916 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-02-18 09:27:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:51,459 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-02-18 09:27:51,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:27:51,459 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-02-18 09:27:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:51,460 INFO L225 Difference]: With dead ends: 167 [2019-02-18 09:27:51,460 INFO L226 Difference]: Without dead ends: 166 [2019-02-18 09:27:51,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:27:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-18 09:27:51,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-02-18 09:27:51,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 09:27:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-02-18 09:27:51,471 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-02-18 09:27:51,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:51,472 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-02-18 09:27:51,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:27:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-02-18 09:27:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-18 09:27:51,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:51,473 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-02-18 09:27:51,473 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:51,473 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-02-18 09:27:51,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:51,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:51,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:51,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:51,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:52,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:52,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:52,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:52,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:52,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:52,812 INFO 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-02-18 09:27:52,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:52,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:52,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:52,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:52,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:52,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:52,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:27:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:54,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:57,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:57,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-18 09:27:57,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:57,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:27:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:27:57,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:27:57,298 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-02-18 09:27:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:57,595 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-18 09:27:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:27:57,595 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-02-18 09:27:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:57,597 INFO L225 Difference]: With dead ends: 171 [2019-02-18 09:27:57,597 INFO L226 Difference]: Without dead ends: 170 [2019-02-18 09:27:57,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:27:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-18 09:27:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-18 09:27:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-18 09:27:57,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-18 09:27:57,601 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-02-18 09:27:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:57,602 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-18 09:27:57,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:27:57,602 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-18 09:27:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-18 09:27:57,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:57,602 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-02-18 09:27:57,603 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-02-18 09:27:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:57,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:57,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:57,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:58,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:58,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:58,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,781 INFO 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-02-18 09:27:58,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:58,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:58,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-18 09:27:58,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:58,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:58,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:27:58,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:59,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:59,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:00,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:03,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:03,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-18 09:28:03,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:03,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:28:03,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:28:03,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:03,643 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-02-18 09:28:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:03,939 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-02-18 09:28:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:28:03,940 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-02-18 09:28:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:03,941 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:28:03,942 INFO L226 Difference]: Without dead ends: 174 [2019-02-18 09:28:03,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-18 09:28:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-02-18 09:28:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-18 09:28:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-02-18 09:28:03,947 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-02-18 09:28:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:03,948 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-02-18 09:28:03,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:28:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-02-18 09:28:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-18 09:28:03,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:03,949 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-02-18 09:28:03,949 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:03,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:03,949 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-02-18 09:28:03,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:03,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:03,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:03,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:05,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:05,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:05,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:05,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:05,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:05,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:28:05,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:05,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:05,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:05,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:05,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:05,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:05,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:05,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:05,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:06,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:10,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:10,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-18 09:28:10,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:10,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:28:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:28:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-18 09:28:10,032 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-02-18 09:28:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:10,614 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-02-18 09:28:10,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:28:10,614 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-02-18 09:28:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:10,615 INFO L225 Difference]: With dead ends: 179 [2019-02-18 09:28:10,615 INFO L226 Difference]: Without dead ends: 178 [2019-02-18 09:28:10,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-18 09:28:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-02-18 09:28:10,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-02-18 09:28:10,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-18 09:28:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-18 09:28:10,623 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-02-18 09:28:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:10,623 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-18 09:28:10,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:28:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-18 09:28:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-18 09:28:10,625 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:10,625 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-02-18 09:28:10,625 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:10,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-02-18 09:28:10,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:10,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:10,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:10,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:10,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:12,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:12,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:12,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:12,530 INFO 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-02-18 09:28:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:12,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:12,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:12,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:12,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:12,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:13,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:17,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:17,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-18 09:28:17,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:17,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:28:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:28:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:28:17,458 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-02-18 09:28:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:17,768 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-18 09:28:17,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:28:17,768 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-02-18 09:28:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:17,770 INFO L225 Difference]: With dead ends: 183 [2019-02-18 09:28:17,770 INFO L226 Difference]: Without dead ends: 182 [2019-02-18 09:28:17,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:28:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-18 09:28:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-18 09:28:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-18 09:28:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-18 09:28:17,774 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-02-18 09:28:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:17,775 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-18 09:28:17,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:28:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-18 09:28:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-18 09:28:17,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:17,776 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-02-18 09:28:17,776 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-02-18 09:28:17,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:17,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:17,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:19,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:19,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:19,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:19,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:19,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:19,349 INFO 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-02-18 09:28:19,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:19,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:19,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-18 09:28:19,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:19,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:19,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:19,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:19,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:19,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:20,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:24,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:24,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-18 09:28:24,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:24,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:28:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:28:24,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-18 09:28:24,471 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-02-18 09:28:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:24,869 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-02-18 09:28:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:28:24,869 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-02-18 09:28:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:24,871 INFO L225 Difference]: With dead ends: 187 [2019-02-18 09:28:24,871 INFO L226 Difference]: Without dead ends: 186 [2019-02-18 09:28:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-18 09:28:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-02-18 09:28:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-02-18 09:28:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 09:28:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-02-18 09:28:24,877 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-02-18 09:28:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-02-18 09:28:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:28:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-02-18 09:28:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 09:28:24,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:24,879 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-02-18 09:28:24,879 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-02-18 09:28:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:24,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:24,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:26,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:26,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:26,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:26,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:26,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:26,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:28:26,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:26,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:26,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:26,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:26,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:26,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:26,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:26,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:26,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:28,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:28,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:31,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:31,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:31,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-18 09:28:31,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:31,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 09:28:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 09:28:31,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:28:31,755 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-02-18 09:28:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:32,117 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-18 09:28:32,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:28:32,118 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-02-18 09:28:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:32,119 INFO L225 Difference]: With dead ends: 191 [2019-02-18 09:28:32,119 INFO L226 Difference]: Without dead ends: 190 [2019-02-18 09:28:32,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:28:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-18 09:28:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-02-18 09:28:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-18 09:28:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-02-18 09:28:32,124 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-02-18 09:28:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:32,124 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-02-18 09:28:32,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 09:28:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-02-18 09:28:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-18 09:28:32,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:32,125 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-02-18 09:28:32,125 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-02-18 09:28:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:32,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:34,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:34,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:34,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,186 INFO 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-02-18 09:28:34,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:34,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:34,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:34,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:34,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:34,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:36,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:40,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:40,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-18 09:28:40,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:40,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 09:28:40,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 09:28:40,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-18 09:28:40,882 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-02-18 09:28:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:41,280 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-18 09:28:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:28:41,281 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-02-18 09:28:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:41,282 INFO L225 Difference]: With dead ends: 195 [2019-02-18 09:28:41,282 INFO L226 Difference]: Without dead ends: 194 [2019-02-18 09:28:41,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-18 09:28:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-18 09:28:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-18 09:28:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 09:28:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-18 09:28:41,290 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-02-18 09:28:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:41,291 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-18 09:28:41,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 09:28:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-18 09:28:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-18 09:28:41,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:41,292 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-02-18 09:28:41,292 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:41,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-02-18 09:28:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:41,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:41,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:41,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:43,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:43,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:43,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:43,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:43,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:43,795 INFO 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-02-18 09:28:43,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:43,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:43,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-18 09:28:43,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:43,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:44,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:44,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:44,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:44,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:45,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:45,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:49,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:49,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-18 09:28:49,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:49,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 09:28:49,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 09:28:49,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:28:49,868 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-02-18 09:28:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:50,247 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-02-18 09:28:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:28:50,247 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-02-18 09:28:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:50,248 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:28:50,248 INFO L226 Difference]: Without dead ends: 198 [2019-02-18 09:28:50,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:28:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-18 09:28:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-02-18 09:28:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-18 09:28:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-18 09:28:50,254 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-02-18 09:28:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:50,254 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-18 09:28:50,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 09:28:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-18 09:28:50,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-18 09:28:50,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:50,256 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-02-18 09:28:50,256 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-02-18 09:28:50,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:50,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:50,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:50,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:52,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:52,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:52,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:52,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:52,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:52,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:52,006 INFO 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-02-18 09:28:52,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:52,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:52,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:52,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:52,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:52,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:28:52,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:52,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:52,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:28:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:53,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:58,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:58,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-18 09:28:58,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:58,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 09:28:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 09:28:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-18 09:28:58,128 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-02-18 09:28:58,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:58,566 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-02-18 09:28:58,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:28:58,567 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-02-18 09:28:58,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:58,568 INFO L225 Difference]: With dead ends: 203 [2019-02-18 09:28:58,568 INFO L226 Difference]: Without dead ends: 202 [2019-02-18 09:28:58,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-18 09:28:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-02-18 09:28:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-02-18 09:28:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-18 09:28:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-02-18 09:28:58,573 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-02-18 09:28:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:58,573 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-02-18 09:28:58,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 09:28:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-02-18 09:28:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-18 09:28:58,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:58,574 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-02-18 09:28:58,574 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-02-18 09:28:58,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:58,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:58,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:00,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:00,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:00,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:00,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:00,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:00,400 INFO 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-02-18 09:29:00,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:00,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:00,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:00,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-02-18 09:29:00,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:00,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:00,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:02,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:06,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:06,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-18 09:29:06,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:06,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 09:29:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 09:29:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:29:06,730 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-02-18 09:29:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:07,076 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-18 09:29:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:29:07,076 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-02-18 09:29:07,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:07,078 INFO L225 Difference]: With dead ends: 207 [2019-02-18 09:29:07,078 INFO L226 Difference]: Without dead ends: 206 [2019-02-18 09:29:07,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:29:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-18 09:29:07,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-18 09:29:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-18 09:29:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-18 09:29:07,085 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-02-18 09:29:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:07,085 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-18 09:29:07,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 09:29:07,085 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-18 09:29:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-18 09:29:07,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:07,087 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-02-18 09:29:07,087 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:07,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-02-18 09:29:07,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:07,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:07,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:09,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:09,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:09,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:09,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:09,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:09,077 INFO 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-02-18 09:29:09,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:09,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:09,286 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-18 09:29:09,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:09,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:09,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:09,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:09,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:09,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:11,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:15,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-18 09:29:15,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:15,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 09:29:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 09:29:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-18 09:29:15,663 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-02-18 09:29:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:16,125 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-18 09:29:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:29:16,126 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-02-18 09:29:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:16,127 INFO L225 Difference]: With dead ends: 211 [2019-02-18 09:29:16,127 INFO L226 Difference]: Without dead ends: 210 [2019-02-18 09:29:16,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-18 09:29:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-18 09:29:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-02-18 09:29:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-18 09:29:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-02-18 09:29:16,134 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-02-18 09:29:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:16,134 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-02-18 09:29:16,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 09:29:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-02-18 09:29:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-18 09:29:16,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:16,135 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-02-18 09:29:16,136 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-02-18 09:29:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:16,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:16,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:18,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:18,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:18,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:18,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:18,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:18,221 INFO 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-02-18 09:29:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:18,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:18,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:18,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:18,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:18,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:18,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:18,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:18,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:21,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:21,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:26,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-18 09:29:26,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:26,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 09:29:26,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 09:29:26,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:29:26,477 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-02-18 09:29:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:26,947 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-02-18 09:29:26,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:29:26,947 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-02-18 09:29:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:26,949 INFO L225 Difference]: With dead ends: 215 [2019-02-18 09:29:26,950 INFO L226 Difference]: Without dead ends: 214 [2019-02-18 09:29:26,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:29:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-02-18 09:29:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-02-18 09:29:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:29:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-02-18 09:29:26,974 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-02-18 09:29:26,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:26,974 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-02-18 09:29:26,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 09:29:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-02-18 09:29:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 09:29:26,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:26,976 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-02-18 09:29:26,976 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:26,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:26,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-02-18 09:29:26,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:26,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:26,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:26,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:26,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:28,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:28,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:28,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:28,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:28,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:28,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 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-02-18 09:29:28,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:28,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:28,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:28,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:28,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:28,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:28,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:30,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:35,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:35,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-18 09:29:35,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:35,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-18 09:29:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-18 09:29:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:29:35,790 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-02-18 09:29:36,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:36,180 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-18 09:29:36,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:29:36,181 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-02-18 09:29:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:36,182 INFO L225 Difference]: With dead ends: 219 [2019-02-18 09:29:36,182 INFO L226 Difference]: Without dead ends: 218 [2019-02-18 09:29:36,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:29:36,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-18 09:29:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-18 09:29:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 09:29:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-18 09:29:36,189 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-02-18 09:29:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:36,189 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-18 09:29:36,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-18 09:29:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-18 09:29:36,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-18 09:29:36,190 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:36,191 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-02-18 09:29:36,191 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:36,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-02-18 09:29:36,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:36,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:36,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:38,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:38,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:38,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:38,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:29:38,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:38,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:38,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-18 09:29:38,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:38,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:38,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:38,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:38,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:38,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:40,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:45,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:45,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-18 09:29:45,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:45,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-18 09:29:45,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-18 09:29:45,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:29:45,326 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-02-18 09:29:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:45,732 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-02-18 09:29:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:29:45,733 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-02-18 09:29:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:45,735 INFO L225 Difference]: With dead ends: 223 [2019-02-18 09:29:45,735 INFO L226 Difference]: Without dead ends: 222 [2019-02-18 09:29:45,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:29:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-18 09:29:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-02-18 09:29:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-18 09:29:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-02-18 09:29:45,739 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-02-18 09:29:45,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:45,740 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-02-18 09:29:45,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-18 09:29:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-02-18 09:29:45,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-02-18 09:29:45,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:45,741 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-02-18 09:29:45,741 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:45,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-02-18 09:29:45,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:45,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:45,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:45,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:47,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:47,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:47,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:47,739 INFO 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-02-18 09:29:47,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:47,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:47,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:47,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:47,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:47,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:47,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:47,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:47,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:50,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:50,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:54,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:54,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-18 09:29:54,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:54,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-18 09:29:54,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-18 09:29:54,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:29:54,936 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-02-18 09:29:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:55,422 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-02-18 09:29:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:29:55,423 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-02-18 09:29:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:55,424 INFO L225 Difference]: With dead ends: 227 [2019-02-18 09:29:55,425 INFO L226 Difference]: Without dead ends: 226 [2019-02-18 09:29:55,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:29:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-18 09:29:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-02-18 09:29:55,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-18 09:29:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-02-18 09:29:55,430 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-02-18 09:29:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:55,431 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-02-18 09:29:55,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-18 09:29:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-02-18 09:29:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-02-18 09:29:55,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:55,432 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-02-18 09:29:55,432 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-02-18 09:29:55,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:55,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:55,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:55,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:55,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:57,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:57,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:57,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:57,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:57,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:57,461 INFO 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-02-18 09:29:57,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:57,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:57,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:57,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:29:57,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:57,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:57,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:29:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:59,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-18 09:30:04,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:04,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-18 09:30:04,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-18 09:30:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:30:04,441 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-02-18 09:30:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:05,023 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-18 09:30:05,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:30:05,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-02-18 09:30:05,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:05,026 INFO L225 Difference]: With dead ends: 231 [2019-02-18 09:30:05,026 INFO L226 Difference]: Without dead ends: 230 [2019-02-18 09:30:05,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:30:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-18 09:30:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-18 09:30:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-18 09:30:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-18 09:30:05,032 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-02-18 09:30:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:05,033 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-18 09:30:05,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-18 09:30:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-18 09:30:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-18 09:30:05,034 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:05,034 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-02-18 09:30:05,035 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-02-18 09:30:05,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:05,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:05,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:05,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:05,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:07,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:07,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:07,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:07,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:07,136 INFO 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-02-18 09:30:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:07,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:07,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-18 09:30:07,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:07,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:07,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:30:07,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:07,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:07,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:30:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:09,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:14,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:14,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-18 09:30:14,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:14,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-18 09:30:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-18 09:30:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-18 09:30:14,733 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-02-18 09:30:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:15,341 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-02-18 09:30:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:30:15,342 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-02-18 09:30:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:15,343 INFO L225 Difference]: With dead ends: 235 [2019-02-18 09:30:15,344 INFO L226 Difference]: Without dead ends: 234 [2019-02-18 09:30:15,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-18 09:30:15,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-18 09:30:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-02-18 09:30:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-02-18 09:30:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-02-18 09:30:15,349 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-02-18 09:30:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:15,349 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-02-18 09:30:15,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-18 09:30:15,350 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-02-18 09:30:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-02-18 09:30:15,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:15,351 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-02-18 09:30:15,351 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:15,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:15,351 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-02-18 09:30:15,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:15,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:15,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:15,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:17,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:17,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:17,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:17,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:17,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:17,565 INFO 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-02-18 09:30:17,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:17,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:17,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:17,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:17,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:17,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:30:17,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:17,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-02-18 09:30:17,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:30:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:20,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:24,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-18 09:30:24,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-18 09:30:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-18 09:30:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:30:24,984 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-02-18 09:30:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:25,520 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-02-18 09:30:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:30:25,520 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-02-18 09:30:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:25,522 INFO L225 Difference]: With dead ends: 239 [2019-02-18 09:30:25,522 INFO L226 Difference]: Without dead ends: 238 [2019-02-18 09:30:25,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:30:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-02-18 09:30:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-02-18 09:30:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-18 09:30:25,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-18 09:30:25,528 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-02-18 09:30:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:25,528 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-18 09:30:25,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-18 09:30:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-18 09:30:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-18 09:30:25,529 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:25,529 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-02-18 09:30:25,529 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:25,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:25,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-02-18 09:30:25,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:25,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:25,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:25,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:27,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:27,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:27,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:27,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:27,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:27,768 INFO 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-02-18 09:30:27,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:27,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:27,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:27,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:30:27,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:27,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:27,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:30:30,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:30,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:35,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-18 09:30:35,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:35,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-18 09:30:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-18 09:30:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-18 09:30:35,242 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-02-18 09:30:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:35,785 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-18 09:30:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:30:35,786 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-02-18 09:30:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:35,787 INFO L225 Difference]: With dead ends: 243 [2019-02-18 09:30:35,787 INFO L226 Difference]: Without dead ends: 242 [2019-02-18 09:30:35,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-18 09:30:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-18 09:30:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-18 09:30:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-18 09:30:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-18 09:30:35,792 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-02-18 09:30:35,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:35,792 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-18 09:30:35,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-18 09:30:35,792 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-18 09:30:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-18 09:30:35,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:35,793 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-02-18 09:30:35,793 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:35,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:35,794 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-02-18 09:30:35,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:35,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:35,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:35,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:38,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:38,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:38,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:38,412 INFO 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-02-18 09:30:38,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:38,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:38,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-18 09:30:38,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:38,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:38,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:30:38,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30: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-02-18 09:30:38,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:30:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:41,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:46,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:46,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-18 09:30:46,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:46,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-18 09:30:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-18 09:30:46,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:30:46,395 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-02-18 09:30:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:46,910 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-02-18 09:30:46,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:30:46,911 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-02-18 09:30:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:46,912 INFO L225 Difference]: With dead ends: 247 [2019-02-18 09:30:46,912 INFO L226 Difference]: Without dead ends: 246 [2019-02-18 09:30:46,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:30:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-02-18 09:30:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-02-18 09:30:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-18 09:30:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-02-18 09:30:46,920 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-02-18 09:30:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:46,920 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-02-18 09:30:46,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-18 09:30:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-02-18 09:30:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-18 09:30:46,921 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:46,922 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-02-18 09:30:46,922 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:46,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-02-18 09:30:46,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:46,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:46,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:46,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:49,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:49,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:49,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:49,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:49,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:49,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 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-02-18 09:30:49,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:49,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:49,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:49,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:49,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:49,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:30:49,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:49,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:49,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:30:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:52,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:57,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:57,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-18 09:30:57,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:57,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-18 09:30:57,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-18 09:30:57,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:30:57,280 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-02-18 09:30:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:57,797 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-18 09:30:57,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:30:57,797 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-02-18 09:30:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:57,798 INFO L225 Difference]: With dead ends: 251 [2019-02-18 09:30:57,799 INFO L226 Difference]: Without dead ends: 250 [2019-02-18 09:30:57,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:30:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-18 09:30:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-02-18 09:30:57,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-02-18 09:30:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-02-18 09:30:57,805 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-02-18 09:30:57,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:57,805 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-02-18 09:30:57,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-18 09:30:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-02-18 09:30:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-02-18 09:30:57,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:57,807 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-02-18 09:30:57,807 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-02-18 09:30:57,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:57,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:57,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:57,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:00,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:00,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:00,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:00,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:00,364 INFO 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-02-18 09:31:00,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:00,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:00,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:00,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:00,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:00,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:00,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:31:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:03,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-18 09:31:08,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:08,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-18 09:31:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-18 09:31:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:08,407 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-02-18 09:31:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:08,913 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-18 09:31:08,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:31:08,914 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-02-18 09:31:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:08,915 INFO L225 Difference]: With dead ends: 255 [2019-02-18 09:31:08,915 INFO L226 Difference]: Without dead ends: 254 [2019-02-18 09:31:08,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:08,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-18 09:31:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-18 09:31:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-18 09:31:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-18 09:31:08,920 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-02-18 09:31:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:08,921 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-18 09:31:08,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-18 09:31:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-18 09:31:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-18 09:31:08,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:08,922 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-02-18 09:31:08,922 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-02-18 09:31:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:08,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:11,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:11,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:11,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:11,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:11,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:11,703 INFO 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-02-18 09:31:11,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:11,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:11,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-18 09:31:11,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:12,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:12,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:12,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:12,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:12,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:31:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:14,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:19,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:19,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:19,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-18 09:31:19,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:19,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-18 09:31:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-18 09:31:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 09:31:19,657 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-02-18 09:31:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:20,123 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-02-18 09:31:20,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:31:20,123 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-02-18 09:31:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:20,125 INFO L225 Difference]: With dead ends: 259 [2019-02-18 09:31:20,125 INFO L226 Difference]: Without dead ends: 258 [2019-02-18 09:31:20,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 09:31:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-18 09:31:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-02-18 09:31:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-18 09:31:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-18 09:31:20,130 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-02-18 09:31:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:20,131 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-18 09:31:20,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-18 09:31:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-18 09:31:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-18 09:31:20,131 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:20,132 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-02-18 09:31:20,132 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-02-18 09:31:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:22,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:22,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:22,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:22,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:22,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:22,906 INFO 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-02-18 09:31:22,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:22,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:22,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:22,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:23,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:23,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:23,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:23,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:23,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:31:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:25,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:30,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-18 09:31:30,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:30,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-18 09:31:30,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-18 09:31:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:30,814 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-02-18 09:31:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:31,325 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-02-18 09:31:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:31:31,326 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-02-18 09:31:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:31,327 INFO L225 Difference]: With dead ends: 263 [2019-02-18 09:31:31,327 INFO L226 Difference]: Without dead ends: 262 [2019-02-18 09:31:31,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-02-18 09:31:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-02-18 09:31:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-02-18 09:31:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-02-18 09:31:31,333 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-02-18 09:31:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:31,333 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-02-18 09:31:31,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-18 09:31:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-02-18 09:31:31,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-02-18 09:31:31,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:31,335 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-02-18 09:31:31,335 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:31,336 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-02-18 09:31:31,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:31,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:31,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:31,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:34,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:34,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:34,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:34,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:34,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:34,181 INFO 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-02-18 09:31:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:34,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:34,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:34,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:34,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:34,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:34,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:31:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:37,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:42,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:42,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-18 09:31:42,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:42,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-18 09:31:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-18 09:31:42,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-18 09:31:42,457 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-02-18 09:31:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:42,999 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-18 09:31:42,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:31:42,999 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-02-18 09:31:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:43,000 INFO L225 Difference]: With dead ends: 267 [2019-02-18 09:31:43,000 INFO L226 Difference]: Without dead ends: 266 [2019-02-18 09:31:43,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-18 09:31:43,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-18 09:31:43,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-18 09:31:43,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-18 09:31:43,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-18 09:31:43,007 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-02-18 09:31:43,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:43,008 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-18 09:31:43,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-18 09:31:43,008 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-18 09:31:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-18 09:31:43,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:43,010 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-02-18 09:31:43,010 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:43,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-02-18 09:31:43,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:43,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:43,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:45,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:45,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:45,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:45,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:45,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:45,630 INFO 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-02-18 09:31:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:45,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:45,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-18 09:31:45,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:45,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:45,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:45,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:45,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:45,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:31:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:48,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:54,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:54,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-18 09:31:54,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:54,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-18 09:31:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-18 09:31:54,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:31:54,228 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-02-18 09:31:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:54,863 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-18 09:31:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:31:54,864 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-02-18 09:31:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:54,865 INFO L225 Difference]: With dead ends: 271 [2019-02-18 09:31:54,865 INFO L226 Difference]: Without dead ends: 270 [2019-02-18 09:31:54,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:31:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-18 09:31:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-02-18 09:31:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-18 09:31:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-02-18 09:31:54,870 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-02-18 09:31:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:54,871 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-02-18 09:31:54,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-18 09:31:54,871 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-02-18 09:31:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-18 09:31:54,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:54,872 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-02-18 09:31:54,872 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-02-18 09:31:54,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:54,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:54,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:54,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:57,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:57,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:57,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:57,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:57,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:57,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:57,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:31:57,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:57,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:58,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:58,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:58,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:58,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:31:58,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:58,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:58,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:32:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:00,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:06,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-18 09:32:06,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:06,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-18 09:32:06,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-18 09:32:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:32:06,214 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-02-18 09:32:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:06,771 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-02-18 09:32:06,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:32:06,771 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-02-18 09:32:06,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:06,773 INFO L225 Difference]: With dead ends: 275 [2019-02-18 09:32:06,773 INFO L226 Difference]: Without dead ends: 274 [2019-02-18 09:32:06,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:32:06,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-18 09:32:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-02-18 09:32:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-18 09:32:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-02-18 09:32:06,778 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-02-18 09:32:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:06,778 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-02-18 09:32:06,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-18 09:32:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-02-18 09:32:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-18 09:32:06,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:06,780 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-02-18 09:32:06,780 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-02-18 09:32:06,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:06,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:06,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:09,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:09,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:09,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:09,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:09,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:09,762 INFO 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-02-18 09:32:09,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:09,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:09,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:09,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:32:09,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:09,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:09,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:32:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:13,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:18,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:18,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-18 09:32:18,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:18,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-18 09:32:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-18 09:32:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:32:18,295 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-02-18 09:32:18,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:18,937 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-18 09:32:18,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:32:18,937 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-02-18 09:32:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:18,939 INFO L225 Difference]: With dead ends: 279 [2019-02-18 09:32:18,939 INFO L226 Difference]: Without dead ends: 278 [2019-02-18 09:32:18,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:32:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-18 09:32:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-18 09:32:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-18 09:32:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-18 09:32:18,946 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-02-18 09:32:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:18,946 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-18 09:32:18,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-18 09:32:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-18 09:32:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-18 09:32:18,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:18,948 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-02-18 09:32:18,948 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:18,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-02-18 09:32:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:18,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:18,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:18,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:21,808 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:21,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:21,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:21,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:21,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:21,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:21,808 INFO 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-02-18 09:32:21,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:21,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:22,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-18 09:32:22,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:22,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:22,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:32:22,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:22,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-02-18 09:32:22,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:32:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:25,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:30,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:30,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-18 09:32:30,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:30,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-18 09:32:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-18 09:32:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-18 09:32:30,587 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-02-18 09:32:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:31,165 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-02-18 09:32:31,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:32:31,165 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-02-18 09:32:31,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:31,167 INFO L225 Difference]: With dead ends: 283 [2019-02-18 09:32:31,167 INFO L226 Difference]: Without dead ends: 282 [2019-02-18 09:32:31,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-18 09:32:31,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-02-18 09:32:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-02-18 09:32:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-02-18 09:32:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-02-18 09:32:31,173 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-02-18 09:32:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:31,174 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-02-18 09:32:31,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-18 09:32:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-02-18 09:32:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-02-18 09:32:31,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:31,175 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-02-18 09:32:31,176 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-02-18 09:32:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:31,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:31,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:31,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:31,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:34,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:34,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:34,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:34,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:34,305 INFO 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-02-18 09:32:34,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:32:34,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:32:34,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:32:34,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:34,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:34,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:32:34,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:34,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:34,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:32:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:37,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:42,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:42,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-18 09:32:42,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:42,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-18 09:32:42,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-18 09:32:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:32:42,842 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-02-18 09:32:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:43,522 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-02-18 09:32:43,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:32:43,522 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-02-18 09:32:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:43,524 INFO L225 Difference]: With dead ends: 287 [2019-02-18 09:32:43,524 INFO L226 Difference]: Without dead ends: 286 [2019-02-18 09:32:43,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:32:43,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-02-18 09:32:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-02-18 09:32:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-18 09:32:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-02-18 09:32:43,529 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-02-18 09:32:43,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:43,529 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-02-18 09:32:43,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-18 09:32:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-02-18 09:32:43,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-02-18 09:32:43,530 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:43,530 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-02-18 09:32:43,530 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:43,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:43,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-02-18 09:32:43,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:43,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:43,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:43,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:46,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:46,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:46,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:46,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:46,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:46,589 INFO 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-02-18 09:32:46,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:46,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:46,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:46,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:32:46,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:46,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:46,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:32:49,994 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:49,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:55,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:55,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-18 09:32:55,252 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:55,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-18 09:32:55,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-18 09:32:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-18 09:32:55,255 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-02-18 09:32:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:55,904 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-18 09:32:55,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 09:32:55,905 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-02-18 09:32:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:55,907 INFO L225 Difference]: With dead ends: 291 [2019-02-18 09:32:55,907 INFO L226 Difference]: Without dead ends: 290 [2019-02-18 09:32:55,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-18 09:32:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-18 09:32:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-18 09:32:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-18 09:32:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-18 09:32:55,913 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-02-18 09:32:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:55,913 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-18 09:32:55,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-18 09:32:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-18 09:32:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-18 09:32:55,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:55,915 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-02-18 09:32:55,915 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:55,915 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-02-18 09:32:55,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:55,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:55,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:55,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:59,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:59,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:59,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:59,307 INFO 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-02-18 09:32:59,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:59,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:59,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-18 09:32:59,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:59,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:59,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:32:59,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:59,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:59,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:33:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:03,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:08,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-18 09:33:08,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-18 09:33:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-18 09:33:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:33:08,676 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-02-18 09:33:09,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:09,418 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-02-18 09:33:09,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 09:33:09,419 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-02-18 09:33:09,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:09,420 INFO L225 Difference]: With dead ends: 295 [2019-02-18 09:33:09,420 INFO L226 Difference]: Without dead ends: 294 [2019-02-18 09:33:09,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:33:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-02-18 09:33:09,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-02-18 09:33:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-02-18 09:33:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-02-18 09:33:09,426 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-02-18 09:33:09,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:09,426 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-02-18 09:33:09,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-18 09:33:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-02-18 09:33:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-02-18 09:33:09,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:09,428 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-02-18 09:33:09,429 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-02-18 09:33:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:09,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:09,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:12,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:12,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:12,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:12,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:12,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:12,811 INFO 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-02-18 09:33:12,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:12,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:12,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:12,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:12,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:12,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:33:12,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:12,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:12,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:33:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:16,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:21,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:21,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-18 09:33:21,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:21,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-18 09:33:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-18 09:33:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 09:33:21,893 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-02-18 09:33:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:22,648 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-02-18 09:33:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:33:22,649 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-02-18 09:33:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:22,651 INFO L225 Difference]: With dead ends: 299 [2019-02-18 09:33:22,651 INFO L226 Difference]: Without dead ends: 298 [2019-02-18 09:33:22,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 09:33:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-02-18 09:33:22,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-02-18 09:33:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-18 09:33:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-18 09:33:22,657 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-02-18 09:33:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:22,658 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-18 09:33:22,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-18 09:33:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-18 09:33:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-18 09:33:22,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:22,659 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-02-18 09:33:22,659 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:22,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-02-18 09:33:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:22,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:22,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:26,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:26,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:26,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:26,469 INFO 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-02-18 09:33:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:26,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:33:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:26,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:26,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:33:26,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:26,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:26,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:33:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:30,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:35,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:35,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-18 09:33:35,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-18 09:33:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-18 09:33:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:33:35,688 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-02-18 09:33:36,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:36,254 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-18 09:33:36,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:33:36,255 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-02-18 09:33:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:36,257 INFO L225 Difference]: With dead ends: 303 [2019-02-18 09:33:36,257 INFO L226 Difference]: Without dead ends: 302 [2019-02-18 09:33:36,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:33:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-18 09:33:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-18 09:33:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-18 09:33:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-18 09:33:36,264 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-02-18 09:33:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:36,265 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-18 09:33:36,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-18 09:33:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-18 09:33:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-18 09:33:36,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:36,267 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-02-18 09:33:36,267 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-02-18 09:33:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:36,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:39,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:39,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:39,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:39,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:39,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:39,800 INFO 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-02-18 09:33:39,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:39,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:40,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-18 09:33:40,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:40,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:40,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:33:40,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:40,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:40,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:33:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:43,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:49,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:49,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-18 09:33:49,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:49,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-18 09:33:49,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-18 09:33:49,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-18 09:33:49,287 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-02-18 09:33:50,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:50,058 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-02-18 09:33:50,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 09:33:50,059 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-02-18 09:33:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:50,060 INFO L225 Difference]: With dead ends: 307 [2019-02-18 09:33:50,060 INFO L226 Difference]: Without dead ends: 306 [2019-02-18 09:33:50,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-18 09:33:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-02-18 09:33:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-02-18 09:33:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-02-18 09:33:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-02-18 09:33:50,066 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-02-18 09:33:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:50,067 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-02-18 09:33:50,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-18 09:33:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-02-18 09:33:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-02-18 09:33:50,068 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:50,068 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-02-18 09:33:50,068 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:50,068 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-02-18 09:33:50,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:50,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:50,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:54,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:54,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:54,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:54,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:54,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:54,031 INFO 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-02-18 09:33:54,040 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:54,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:54,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:54,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:54,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:54,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:33:54,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:54,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:54,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:33:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:58,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:03,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:03,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-18 09:34:03,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:03,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-18 09:34:03,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-18 09:34:03,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:34:03,619 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-02-18 09:34:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:04,263 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-18 09:34:04,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 09:34:04,264 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-02-18 09:34:04,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:04,265 INFO L225 Difference]: With dead ends: 311 [2019-02-18 09:34:04,265 INFO L226 Difference]: Without dead ends: 310 [2019-02-18 09:34:04,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:34:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-18 09:34:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-02-18 09:34:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-02-18 09:34:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-02-18 09:34:04,270 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-02-18 09:34:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:04,270 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-02-18 09:34:04,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-18 09:34:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-02-18 09:34:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-02-18 09:34:04,271 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:04,272 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-02-18 09:34:04,272 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:04,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:04,272 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-02-18 09:34:04,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:08,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:08,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:08,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:08,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:08,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:08,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:08,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 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-02-18 09:34:08,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:08,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:08,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:08,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:34:08,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:08,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-02-18 09:34:08,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:34:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:12,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:17,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:17,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-18 09:34:17,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:17,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-18 09:34:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-18 09:34:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-18 09:34:17,709 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-02-18 09:34:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:18,346 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-02-18 09:34:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 09:34:18,347 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-02-18 09:34:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:18,348 INFO L225 Difference]: With dead ends: 315 [2019-02-18 09:34:18,348 INFO L226 Difference]: Without dead ends: 314 [2019-02-18 09:34:18,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-18 09:34:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-18 09:34:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-02-18 09:34:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-02-18 09:34:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-02-18 09:34:18,353 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-02-18 09:34:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:18,353 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-02-18 09:34:18,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-18 09:34:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-02-18 09:34:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-02-18 09:34:18,354 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:18,355 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-02-18 09:34:18,355 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-02-18 09:34:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:18,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:18,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:18,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:22,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:22,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:22,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:22,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:22,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:22,273 INFO 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-02-18 09:34:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:34:22,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:34:22,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-18 09:34:22,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:22,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:22,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:34:22,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:22,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:22,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:34:26,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:26,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:32,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-18 09:34:32,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:32,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-18 09:34:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-18 09:34:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:34:32,355 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-02-18 09:34:33,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:33,050 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-02-18 09:34:33,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:34:33,051 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-02-18 09:34:33,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:33,052 INFO L225 Difference]: With dead ends: 319 [2019-02-18 09:34:33,052 INFO L226 Difference]: Without dead ends: 318 [2019-02-18 09:34:33,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:34:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-18 09:34:33,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-02-18 09:34:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-18 09:34:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-18 09:34:33,059 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-02-18 09:34:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:33,060 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-18 09:34:33,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-18 09:34:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-18 09:34:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-18 09:34:33,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:33,061 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-02-18 09:34:33,061 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:33,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-02-18 09:34:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:33,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:33,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:33,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:37,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:37,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:37,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:37,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:37,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:37,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:34:37,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:37,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:37,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:37,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:37,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:37,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:34:37,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:37,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:37,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:34:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:41,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:46,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:46,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-18 09:34:46,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:46,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-18 09:34:46,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-18 09:34:46,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 09:34:46,847 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-02-18 09:34:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:47,602 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-02-18 09:34:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 09:34:47,603 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-02-18 09:34:47,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:47,605 INFO L225 Difference]: With dead ends: 323 [2019-02-18 09:34:47,605 INFO L226 Difference]: Without dead ends: 322 [2019-02-18 09:34:47,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 09:34:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-02-18 09:34:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-02-18 09:34:47,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-02-18 09:34:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-02-18 09:34:47,611 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-02-18 09:34:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:47,611 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-02-18 09:34:47,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-18 09:34:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-02-18 09:34:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-02-18 09:34:47,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:47,613 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-02-18 09:34:47,613 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:47,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-02-18 09:34:47,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:47,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:47,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:47,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:51,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:51,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:51,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:51,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:51,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:51,463 INFO 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-02-18 09:34:51,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:51,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:51,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:51,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:34:51,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:51,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:51,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:34:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:55,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:01,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-18 09:35:01,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:01,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-18 09:35:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-18 09:35:01,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:35:01,490 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-02-18 09:35:02,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:02,252 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-02-18 09:35:02,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 09:35:02,253 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-02-18 09:35:02,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:02,254 INFO L225 Difference]: With dead ends: 327 [2019-02-18 09:35:02,254 INFO L226 Difference]: Without dead ends: 326 [2019-02-18 09:35:02,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:35:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-02-18 09:35:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-02-18 09:35:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-18 09:35:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-02-18 09:35:02,260 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-02-18 09:35:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:02,260 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-02-18 09:35:02,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-18 09:35:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-02-18 09:35:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-02-18 09:35:02,261 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:02,261 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-02-18 09:35:02,262 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:02,262 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-02-18 09:35:02,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:02,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:02,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:06,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:06,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:06,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:06,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:06,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:06,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:35:06,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:06,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:35:06,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-18 09:35:06,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:06,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:06,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:35:06,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:06,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:06,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:35:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:11,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:16,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-18 09:35:16,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:16,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-18 09:35:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-18 09:35:16,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-18 09:35:16,833 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-02-18 09:35:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:17,618 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-18 09:35:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:35:17,619 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-02-18 09:35:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:17,621 INFO L225 Difference]: With dead ends: 331 [2019-02-18 09:35:17,621 INFO L226 Difference]: Without dead ends: 330 [2019-02-18 09:35:17,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-18 09:35:17,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-18 09:35:17,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-02-18 09:35:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-18 09:35:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-02-18 09:35:17,627 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-02-18 09:35:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:17,627 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-02-18 09:35:17,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-18 09:35:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-02-18 09:35:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-02-18 09:35:17,628 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:17,629 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-02-18 09:35:17,629 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:17,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-02-18 09:35:17,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:17,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:17,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:21,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:21,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:21,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:21,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:21,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 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-02-18 09:35:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:35:21,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:35:21,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:35:21,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:21,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:21,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:35:21,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:21,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:21,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:35:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:26,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:31,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:31,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-18 09:35:31,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:31,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-18 09:35:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-18 09:35:31,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:35:31,928 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-02-18 09:35:32,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:32,746 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-02-18 09:35:32,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 09:35:32,746 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-02-18 09:35:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:32,748 INFO L225 Difference]: With dead ends: 335 [2019-02-18 09:35:32,749 INFO L226 Difference]: Without dead ends: 334 [2019-02-18 09:35:32,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:35:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-02-18 09:35:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-02-18 09:35:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-02-18 09:35:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-02-18 09:35:32,755 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-02-18 09:35:32,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:32,755 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-02-18 09:35:32,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-18 09:35:32,755 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-02-18 09:35:32,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-02-18 09:35:32,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:32,756 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-02-18 09:35:32,757 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:32,757 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-02-18 09:35:32,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:32,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:32,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:32,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:32,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:36,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:36,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:36,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:36,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:36,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:36,940 INFO 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-02-18 09:35:36,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:36,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:37,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:37,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:35:37,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:37,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:37,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:35:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:41,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:47,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:47,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-18 09:35:47,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:47,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-18 09:35:47,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-18 09:35:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 09:35:47,309 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-02-18 09:35:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:48,083 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-02-18 09:35:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 09:35:48,084 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-02-18 09:35:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:48,085 INFO L225 Difference]: With dead ends: 339 [2019-02-18 09:35:48,085 INFO L226 Difference]: Without dead ends: 338 [2019-02-18 09:35:48,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 09:35:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-02-18 09:35:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-02-18 09:35:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-18 09:35:48,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-18 09:35:48,091 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-02-18 09:35:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:48,092 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-18 09:35:48,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-18 09:35:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-18 09:35:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-18 09:35:48,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:48,093 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-02-18 09:35:48,093 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-02-18 09:35:48,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:48,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:52,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:52,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:52,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:52,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:52,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:52,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:35:52,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:52,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:35:52,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-18 09:35:52,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:52,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:52,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:35:52,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:52,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:52,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:35:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:57,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-18 09:36:03,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:03,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-18 09:36:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-18 09:36:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:36:03,230 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-02-18 09:36:04,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:04,035 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-02-18 09:36:04,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:36:04,035 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-02-18 09:36:04,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:04,036 INFO L225 Difference]: With dead ends: 343 [2019-02-18 09:36:04,036 INFO L226 Difference]: Without dead ends: 342 [2019-02-18 09:36:04,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:36:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-18 09:36:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-02-18 09:36:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-18 09:36:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-02-18 09:36:04,043 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-02-18 09:36:04,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:04,043 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-02-18 09:36:04,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-18 09:36:04,043 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-02-18 09:36:04,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-02-18 09:36:04,044 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:04,044 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-02-18 09:36:04,044 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-02-18 09:36:04,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:04,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:04,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:04,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:04,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:08,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:08,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:08,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:08,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:08,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:08,427 INFO 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-02-18 09:36:08,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:08,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:08,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:08,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:08,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:08,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:36:08,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:08,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:08,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:36:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:13,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:19,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:19,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-18 09:36:19,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:19,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-18 09:36:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-18 09:36:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 09:36:19,091 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-02-18 09:36:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:20,043 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-02-18 09:36:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 09:36:20,044 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-02-18 09:36:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:20,046 INFO L225 Difference]: With dead ends: 347 [2019-02-18 09:36:20,046 INFO L226 Difference]: Without dead ends: 346 [2019-02-18 09:36:20,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 09:36:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-18 09:36:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-02-18 09:36:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-02-18 09:36:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-02-18 09:36:20,053 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-02-18 09:36:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:20,053 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-02-18 09:36:20,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-18 09:36:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-02-18 09:36:20,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-02-18 09:36:20,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:20,055 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-02-18 09:36:20,055 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:20,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:20,055 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-02-18 09:36:20,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:20,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:20,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:24,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:24,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:24,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:24,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:24,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:24,772 INFO 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-02-18 09:36:24,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:24,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:36:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:24,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:24,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:36:24,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:24,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:24,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:36:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:29,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:35,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:35,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-18 09:36:35,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:35,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-18 09:36:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-18 09:36:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:36:35,429 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-02-18 09:36:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:36,307 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-18 09:36:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 09:36:36,308 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-02-18 09:36:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:36,310 INFO L225 Difference]: With dead ends: 351 [2019-02-18 09:36:36,310 INFO L226 Difference]: Without dead ends: 350 [2019-02-18 09:36:36,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:36:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-18 09:36:36,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-02-18 09:36:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-02-18 09:36:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-02-18 09:36:36,316 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-02-18 09:36:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:36,317 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-02-18 09:36:36,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-18 09:36:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-02-18 09:36:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-02-18 09:36:36,318 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:36,318 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-02-18 09:36:36,319 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-02-18 09:36:36,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:36,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:36,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:36,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:41,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:41,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:41,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:41,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,450 INFO 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-02-18 09:36:41,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:36:41,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:36:41,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-18 09:36:41,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:42,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:42,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:36:42,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:42,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:42,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:36:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:46,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:52,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:52,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:52,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-18 09:36:52,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:52,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-18 09:36:52,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-18 09:36:52,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-18 09:36:52,774 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-02-18 09:36:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:53,530 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-02-18 09:36:53,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 09:36:53,531 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-02-18 09:36:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:53,533 INFO L225 Difference]: With dead ends: 355 [2019-02-18 09:36:53,533 INFO L226 Difference]: Without dead ends: 354 [2019-02-18 09:36:53,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-18 09:36:53,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-02-18 09:36:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-02-18 09:36:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-02-18 09:36:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-02-18 09:36:53,539 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-02-18 09:36:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:53,539 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-02-18 09:36:53,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-18 09:36:53,540 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-02-18 09:36:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-02-18 09:36:53,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:53,541 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-02-18 09:36:53,541 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:53,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:53,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-02-18 09:36:53,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:53,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:53,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:53,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:58,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:58,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:58,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:58,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-18 09:36:58,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:58,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:58,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:58,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:58,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:58,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-02-18 09:36:58,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:58,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:58,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:37:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:03,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:09,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:09,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-18 09:37:09,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:09,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-18 09:37:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-18 09:37:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:37:09,385 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-02-18 09:37:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:10,219 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-02-18 09:37:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 09:37:10,219 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-02-18 09:37:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:10,220 INFO L225 Difference]: With dead ends: 359 [2019-02-18 09:37:10,220 INFO L226 Difference]: Without dead ends: 358 [2019-02-18 09:37:10,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:37:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-18 09:37:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-02-18 09:37:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-18 09:37:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-18 09:37:10,226 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-02-18 09:37:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:10,227 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-18 09:37:10,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-18 09:37:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-18 09:37:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-18 09:37:10,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:10,228 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-02-18 09:37:10,228 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-02-18 09:37:10,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:10,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:10,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:10,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:10,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:15,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:15,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:15,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:15,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:15,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:15,032 INFO 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-02-18 09:37:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:15,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:15,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:15,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-02-18 09:37:15,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:15,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:15,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:37:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:20,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:26,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-18 09:37:26,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:26,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-18 09:37:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-18 09:37:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-18 09:37:26,052 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-02-18 09:37:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:26,983 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-02-18 09:37:26,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:37:26,983 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-02-18 09:37:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:26,985 INFO L225 Difference]: With dead ends: 363 [2019-02-18 09:37:26,985 INFO L226 Difference]: Without dead ends: 362 [2019-02-18 09:37:26,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-18 09:37:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-18 09:37:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-02-18 09:37:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-02-18 09:37:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-02-18 09:37:26,992 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-02-18 09:37:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:26,992 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-02-18 09:37:26,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-18 09:37:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-02-18 09:37:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-02-18 09:37:26,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:26,994 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-02-18 09:37:26,994 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:26,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:26,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-02-18 09:37:26,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:26,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:26,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:26,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:31,956 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:31,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:31,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:31,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:31,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:31,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:31,957 INFO 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-02-18 09:37:31,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:37:31,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:37:32,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-18 09:37:32,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:32,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:32,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:37:32,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:32,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:32,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:37:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:37,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:43,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:43,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-18 09:37:43,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:43,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-18 09:37:43,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-18 09:37:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:37:43,577 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-02-18 09:37:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:44,405 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-02-18 09:37:44,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 09:37:44,406 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-02-18 09:37:44,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:44,408 INFO L225 Difference]: With dead ends: 367 [2019-02-18 09:37:44,408 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 09:37:44,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:37:44,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 09:37:44,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-02-18 09:37:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-02-18 09:37:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-02-18 09:37:44,414 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-02-18 09:37:44,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:44,414 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-02-18 09:37:44,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-18 09:37:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-02-18 09:37:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-02-18 09:37:44,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:44,416 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-02-18 09:37:44,416 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:44,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:44,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-02-18 09:37:44,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:44,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:44,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:49,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:49,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:49,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:49,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:49,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:49,499 INFO 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-02-18 09:37:49,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:37:49,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:37:49,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:37:49,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:49,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:49,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:37:49,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:49,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:37:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:55,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:00,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-18 09:38:00,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:00,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-18 09:38:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-18 09:38:00,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 09:38:00,799 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-02-18 09:38:01,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:01,636 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-18 09:38:01,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 09:38:01,637 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-02-18 09:38:01,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:01,638 INFO L225 Difference]: With dead ends: 371 [2019-02-18 09:38:01,638 INFO L226 Difference]: Without dead ends: 370 [2019-02-18 09:38:01,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 09:38:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-18 09:38:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-02-18 09:38:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-02-18 09:38:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-02-18 09:38:01,645 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-02-18 09:38:01,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:01,645 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-02-18 09:38:01,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-18 09:38:01,645 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-02-18 09:38:01,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-02-18 09:38:01,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:01,647 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-02-18 09:38:01,647 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:01,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-02-18 09:38:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:01,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:01,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:01,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:01,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:06,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:06,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:06,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:06,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:06,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:06,942 INFO 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-02-18 09:38:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:06,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:07,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:07,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:38:07,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:07,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:38:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:12,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:18,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:18,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-18 09:38:18,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:18,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-18 09:38:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-18 09:38:18,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:38:18,311 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-02-18 09:38:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:19,120 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-02-18 09:38:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 09:38:19,120 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-02-18 09:38:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:19,122 INFO L225 Difference]: With dead ends: 375 [2019-02-18 09:38:19,123 INFO L226 Difference]: Without dead ends: 374 [2019-02-18 09:38:19,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:38:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-02-18 09:38:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-02-18 09:38:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-02-18 09:38:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-02-18 09:38:19,128 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-02-18 09:38:19,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:19,129 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-02-18 09:38:19,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-18 09:38:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-02-18 09:38:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-02-18 09:38:19,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:19,130 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-02-18 09:38:19,130 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-02-18 09:38:19,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:19,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:19,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:24,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:24,350 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:24,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:24,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:24,350 INFO 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-02-18 09:38:24,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:24,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:24,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-18 09:38:24,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:24,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:25,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:38:25,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:25,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:38:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:30,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:36,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:36,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-18 09:38:36,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-18 09:38:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-18 09:38:36,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-18 09:38:36,219 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-02-18 09:38:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:37,065 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-02-18 09:38:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 09:38:37,066 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-02-18 09:38:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:37,068 INFO L225 Difference]: With dead ends: 379 [2019-02-18 09:38:37,068 INFO L226 Difference]: Without dead ends: 378 [2019-02-18 09:38:37,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-18 09:38:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-02-18 09:38:37,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-02-18 09:38:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-18 09:38:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-18 09:38:37,074 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-02-18 09:38:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-18 09:38:37,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-18 09:38:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-18 09:38:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-18 09:38:37,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,076 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-02-18 09:38:37,076 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,077 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-02-18 09:38:37,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:42,419 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:42,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:42,419 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:42,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:42,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:42,419 INFO 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-02-18 09:38:42,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:42,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:42,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:42,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:42,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:42,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-18 09:38:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:42,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-02-18 09:38:42,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-18 09:38:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:48,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:54,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:54,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-18 09:38:54,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:54,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-18 09:38:54,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-18 09:38:54,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:38:54,232 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-02-18 09:38:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:54,971 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-02-18 09:38:54,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 09:38:54,972 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-02-18 09:38:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:54,974 INFO L225 Difference]: With dead ends: 383 [2019-02-18 09:38:54,974 INFO L226 Difference]: Without dead ends: 382 [2019-02-18 09:38:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:38:54,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-02-18 09:38:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-02-18 09:38:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-02-18 09:38:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-02-18 09:38:54,981 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-02-18 09:38:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:54,982 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-02-18 09:38:54,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-18 09:38:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-02-18 09:38:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-02-18 09:38:54,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:54,984 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-02-18 09:38:54,984 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:54,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-02-18 09:38:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:54,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat