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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:25:47,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:25:47,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:25:47,600 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:25:47,600 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:25:47,601 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:25:47,603 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:25:47,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:25:47,607 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:25:47,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:25:47,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:25:47,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:25:47,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:25:47,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:25:47,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:25:47,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:25:47,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:25:47,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:25:47,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:25:47,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:25:47,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:25:47,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:25:47,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:25:47,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:25:47,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:25:47,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:25:47,628 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:25:47,629 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:25:47,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:25:47,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:25:47,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:25:47,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:25:47,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:25:47,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:25:47,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:25:47,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:25:47,636 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:25:47,649 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:25:47,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:25:47,650 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:25:47,650 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:25:47,651 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:25:47,651 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:25:47,651 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:25:47,651 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:25:47,652 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:25:47,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:25:47,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:25:47,654 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:25:47,654 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:25:47,654 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:25:47,654 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:25:47,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:25:47,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:25:47,655 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:25:47,655 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:25:47,655 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:25:47,655 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:25:47,656 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:25:47,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:25:47,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:25:47,656 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:25:47,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:25:47,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:47,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:25:47,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:25:47,657 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:25:47,657 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:25:47,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:25:47,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:25:47,658 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:25:47,658 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:25:47,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:25:47,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:25:47,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:25:47,704 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:25:47,705 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:25:47,706 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-02-18 09:25:47,706 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-18 09:25:47,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:25:47,736 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:25:47,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:47,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:25:47,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:25:47,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,769 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:25:47,770 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:25:47,770 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:25:47,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:47,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:25:47,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:25:47,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:25:47,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/1) ... [2019-02-18 09:25:47,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:25:47,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:25:47,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:25:47,796 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:25:47,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (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:25:47,863 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-18 09:25:47,864 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:25:47,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:25:48,048 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:25:48,048 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-18 09:25:48,050 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48 BoogieIcfgContainer [2019-02-18 09:25:48,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:25:48,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:25:48,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:25:48,056 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:25:48,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:47" (1/2) ... [2019-02-18 09:25:48,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770e344c and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:48, skipping insertion in model container [2019-02-18 09:25:48,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48" (2/2) ... [2019-02-18 09:25:48,061 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-18 09:25:48,071 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:25:48,082 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:25:48,101 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:25:48,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:25:48,143 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:25:48,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:25:48,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:25:48,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:25:48,144 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:25:48,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:25:48,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:25:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-18 09:25:48,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:25:48,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:25:48,175 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,181 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-18 09:25:48,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:48,719 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-18 09:25:48,794 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:25:48,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:25:48,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:25:48,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:25:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:25:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:25:48,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:25:48,815 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-18 09:25:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:48,934 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:25:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:25:48,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:25:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:48,948 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:25:48,948 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:25:48,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:25:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:25:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-18 09:25:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 09:25:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-18 09:25:48,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-18 09:25:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:48,990 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-18 09:25:48,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:25:48,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-18 09:25:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:25:48,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,991 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:25:48,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-18 09:25:48,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,286 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:25:49,661 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-18 09:25:49,844 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-18 09:25:49,981 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-18 09:25:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:49,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:49,985 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:25:49,987 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-18 09:25:50,025 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:25:50,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:25:50,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:25:50,123 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 7 times. Never widened. Performed 46 root evaluator evaluations with a maximum evaluation depth of 3. Performed 46 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:25:50,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:25:50,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,131 INFO 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:25:50,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:50,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:50,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:50,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:50,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:50,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:50,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:50,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:50,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:50,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:50,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:25:50,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:50,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:25:50,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:25:50,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:25:50,580 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-18 09:25:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,846 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-18 09:25:50,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:25:50,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:25:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,853 INFO L225 Difference]: With dead ends: 10 [2019-02-18 09:25:50,853 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:25:50,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:25:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:25:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-18 09:25:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:25:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-18 09:25:50,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-18 09:25:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-18 09:25:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:25:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-18 09:25:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:25:50,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,860 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-18 09:25:50,860 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-18 09:25:50,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,179 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:25:51,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:51,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:51,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:51,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:25:51,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:51,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:51,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 8 treesize of output 7 [2019-02-18 09:25:51,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:51,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:51,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:51,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:51,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:51,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:51,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:25:51,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:25:51,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:25:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:51,538 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-18 09:25:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:51,640 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-18 09:25:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:25:51,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:25:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:51,642 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:25:51,642 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:25:51,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:25:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-18 09:25:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:25:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-18 09:25:51,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-18 09:25:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-18 09:25:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:25:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-18 09:25:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:25:51,647 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:51,647 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-18 09:25:51,647 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:51,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-18 09:25:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:51,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,995 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:25:51,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,995 INFO 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:25:52,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:52,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:52,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:52,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:52,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:52,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:52,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:52,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:52,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:25:52,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:52,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:25:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:25:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:25:52,379 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-18 09:25:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,520 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:25:52,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:25:52,521 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:25:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,522 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:25:52,522 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:25:52,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:25:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:25:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-18 09:25:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:25:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-18 09:25:52,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-18 09:25:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,526 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-18 09:25:52,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:25:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-18 09:25:52,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 09:25:52,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,527 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-18 09:25:52,527 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,528 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-18 09:25:52,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:52,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:52,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:52,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:52,920 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:25:52,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:52,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:52,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:52,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:53,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:53,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:53,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:53,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:53,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:53,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-18 09:25:53,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:53,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:25:53,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:25:53,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:53,427 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-18 09:25:53,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:53,530 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-18 09:25:53,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:25:53,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-18 09:25:53,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:53,531 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:25:53,532 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:25:53,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:25:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-18 09:25:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:25:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-18 09:25:53,535 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-18 09:25:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:53,536 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-18 09:25:53,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:25:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-18 09:25:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:25:53,536 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:53,536 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-18 09:25:53,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-18 09:25:53,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:53,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:54,037 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:54,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:54,038 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:25:54,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:54,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:54,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:54,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:25:54,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:54,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:54,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:54,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:54,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:54,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:54,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:54,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:54,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:54,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:54,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:54,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-18 09:25:54,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:54,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:25:54,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:25:54,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:25:54,508 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-18 09:25:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:54,631 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-18 09:25:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:25:54,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-18 09:25:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:54,633 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:25:54,633 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:25:54,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:25:54,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:25:54,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-18 09:25:54,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:25:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-18 09:25:54,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-18 09:25:54,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:54,638 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-18 09:25:54,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:25:54,639 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-18 09:25:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-18 09:25:54,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:54,639 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-18 09:25:54,640 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-18 09:25:54,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:54,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:54,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:54,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:54,998 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:25:54,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:55,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:55,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:55,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:55,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:55,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:55,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:55,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:55,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:55,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:55,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:55,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:55,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:55,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:55,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:56,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-18 09:25:56,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:56,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:25:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:25:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:56,030 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-18 09:25:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:56,287 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-18 09:25:56,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:25:56,288 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-18 09:25:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:56,289 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:25:56,289 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:25:56,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:25:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-18 09:25:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:25:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-18 09:25:56,295 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-18 09:25:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:56,295 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-18 09:25:56,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:25:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-18 09:25:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-18 09:25:56,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:56,296 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-18 09:25:56,296 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:56,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-18 09:25:56,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:56,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:56,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:56,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:56,648 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:25:56,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:56,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:56,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:56,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:56,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:56,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:56,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:56,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:56,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:56,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:57,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:57,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:57,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-18 09:25:57,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:57,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:25:57,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:25:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-18 09:25:57,298 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-18 09:25:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:57,767 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-18 09:25:57,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:25:57,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-18 09:25:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:57,768 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:25:57,768 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:25:57,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-18 09:25:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:25:57,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-18 09:25:57,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:25:57,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-18 09:25:57,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-18 09:25:57,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:57,774 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-18 09:25:57,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:25:57,775 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-18 09:25:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-18 09:25:57,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:57,776 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-18 09:25:57,776 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-18 09:25:57,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:57,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:58,503 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-18 09:25:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:58,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:58,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:58,508 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:25:58,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:58,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:58,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:58,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:25:58,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:58,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:58,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:25:58,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:58,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:58,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:25:59,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:25:59,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:25:59,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:25:59,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:25:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:25:59,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:01,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:01,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-18 09:26:01,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:01,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:26:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:26:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:26:01,381 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-18 09:26:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:01,707 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-18 09:26:01,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:26:01,710 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-18 09:26:01,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:01,711 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:26:01,711 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:26:01,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:26:01,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:26:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-18 09:26:01,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:26:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-18 09:26:01,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-18 09:26:01,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:01,716 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-18 09:26:01,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:26:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-18 09:26:01,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-18 09:26:01,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:01,717 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-18 09:26:01,717 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:01,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-18 09:26:01,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:02,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:02,085 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:02,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:26:02,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:02,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:02,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:02,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:02,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:02,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:02,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:02,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:02,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:02,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:02,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:02,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:02,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:02,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-18 09:26:02,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:02,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:26:02,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:26:02,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-18 09:26:02,755 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-18 09:26:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:03,020 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-18 09:26:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:26:03,021 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-18 09:26:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:03,022 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:26:03,022 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:26:03,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-18 09:26:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:26:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-18 09:26:03,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:26:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-18 09:26:03,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-18 09:26:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:03,027 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-18 09:26:03,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:26:03,027 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-18 09:26:03,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:26:03,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:03,028 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-18 09:26:03,028 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:03,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:03,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-18 09:26:03,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:03,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,274 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:26:03,540 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:03,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:03,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:03,976 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:03,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,976 INFO 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:03,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:03,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:04,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:04,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:04,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:04,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:04,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:04,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:04,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:04,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:04,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:04,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:05,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-18 09:26:05,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:05,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:26:05,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:26:05,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:05,056 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-18 09:26:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:05,445 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-18 09:26:05,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:26:05,446 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-18 09:26:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:05,447 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:26:05,447 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:26:05,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:26:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-18 09:26:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:26:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-18 09:26:05,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-18 09:26:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:05,453 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-18 09:26:05,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:26:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-18 09:26:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-18 09:26:05,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:05,454 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-18 09:26:05,454 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-18 09:26:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:05,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:05,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:05,783 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:06,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:06,207 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,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,207 INFO 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:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:06,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:06,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-18 09:26:06,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:06,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:06,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:06,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:06,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:06,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:06,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:06,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:07,174 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:07,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:07,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-18 09:26:07,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:07,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:26:07,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:26:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-18 09:26:07,195 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-18 09:26:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:07,537 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-18 09:26:07,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:26:07,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-18 09:26:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:07,539 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:26:07,539 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:26:07,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-18 09:26:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:26:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-18 09:26:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:26:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-18 09:26:07,546 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-18 09:26:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:07,546 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-18 09:26:07,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:26:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-18 09:26:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:26:07,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:07,547 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-18 09:26:07,547 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:07,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:07,548 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-18 09:26:07,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:07,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:08,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:08,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:26:08,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:08,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 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:08,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:08,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:08,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:08,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:08,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:08,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:08,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:08,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:08,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:08,575 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:08,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:09,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:09,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-18 09:26:09,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:09,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:26:09,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:26:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:09,448 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-18 09:26:09,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:09,901 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-18 09:26:09,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:26:09,901 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-18 09:26:09,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:09,902 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:26:09,903 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:26:09,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:09,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:26:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-18 09:26:09,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:26:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-18 09:26:09,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-18 09:26:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:09,909 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-18 09:26:09,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:26:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-18 09:26:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-18 09:26:09,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:09,911 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-18 09:26:09,911 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-18 09:26:09,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:09,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:10,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:10,503 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,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,504 INFO 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:10,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:10,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:10,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:10,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:10,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:10,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:10,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:10,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:11,556 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:11,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-18 09:26:11,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:11,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:26:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:26:11,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-18 09:26:11,576 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-18 09:26:12,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:12,314 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-18 09:26:12,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:26:12,314 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-18 09:26:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:12,315 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:26:12,315 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:26:12,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-18 09:26:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:26:12,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-18 09:26:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:26:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-18 09:26:12,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-18 09:26:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:12,322 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-18 09:26:12,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:26:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-18 09:26:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-18 09:26:12,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:12,323 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-18 09:26:12,323 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:12,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-18 09:26:12,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:12,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:12,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:13,231 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-18 09:26:13,235 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,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:13,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:13,236 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,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:13,236 INFO 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:13,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:13,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:13,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:26:13,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:13,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:13,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:13,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:13,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:13,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:13,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:13,736 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,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:15,013 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:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-18 09:26:15,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:15,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:26:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:26:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:15,034 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-18 09:26:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:15,655 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-18 09:26:15,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:26:15,655 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-18 09:26:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:15,657 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:26:15,657 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:26:15,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:26:15,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-18 09:26:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:26:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-18 09:26:15,663 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-18 09:26:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:15,663 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-18 09:26:15,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:26:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-18 09:26:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-18 09:26:15,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:15,664 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-18 09:26:15,664 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:15,665 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-18 09:26:15,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:15,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:15,860 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:16,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:16,332 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,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:16,332 INFO 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:16,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:16,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:16,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:16,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:16,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:16,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 8 treesize of output 7 [2019-02-18 09:26:16,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:16,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:16,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:16,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:16,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:18,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:18,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-18 09:26:18,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:18,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:26:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:26:18,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-18 09:26:18,572 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-18 09:26:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:19,047 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-18 09:26:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:26:19,048 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-18 09:26:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:19,048 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:26:19,049 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:26:19,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-18 09:26:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:26:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-18 09:26:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:26:19,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-18 09:26:19,053 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-18 09:26:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:19,054 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-18 09:26:19,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:26:19,054 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-18 09:26:19,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-18 09:26:19,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:19,055 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-18 09:26:19,055 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:19,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:19,055 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-18 09:26:19,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:19,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:19,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:19,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:19,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:19,729 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:19,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:19,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:19,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:19,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:19,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:19,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:19,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:19,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:20,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:20,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:20,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:20,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:20,385 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:20,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-18 09:26:21,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:21,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:26:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:26:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:21,276 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-18 09:26:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:22,152 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-18 09:26:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:26:22,152 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-18 09:26:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:22,153 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:26:22,153 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:26:22,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:26:22,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-18 09:26:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:26:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-18 09:26:22,160 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-18 09:26:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:22,161 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-18 09:26:22,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:26:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-18 09:26:22,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:26:22,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:22,162 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-18 09:26:22,162 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:22,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-18 09:26:22,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:22,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:22,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:22,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:22,421 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:26:22,998 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:22,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:22,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:22,999 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,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,999 INFO 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:23,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:23,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:23,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:26:23,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:23,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:23,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:23,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:23,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:23,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:23,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:23,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:23,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:23,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:23,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:24,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:24,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-18 09:26:24,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:24,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:26:24,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:26:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-18 09:26:24,941 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-18 09:26:25,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:25,743 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-18 09:26:25,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:26:25,744 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-18 09:26:25,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:25,745 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:26:25,745 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:26:25,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-18 09:26:25,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:26:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-18 09:26:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:26:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-18 09:26:25,751 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-18 09:26:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:25,751 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-18 09:26:25,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:26:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-18 09:26:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-18 09:26:25,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:25,753 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-18 09:26:25,753 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-18 09:26:25,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:26,023 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:26:26,284 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:26,592 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:26:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:27,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:27,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:27,226 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:27,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:27,226 INFO 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:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:27,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:27,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:27,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:27,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:27,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:27,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:27,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:27,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:27,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:27,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:27,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:27,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:27,920 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:27,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:28,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-18 09:26:28,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:28,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:26:28,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:26:28,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:28,947 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-18 09:26:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:30,100 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-18 09:26:30,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:26:30,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-18 09:26:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:30,101 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:26:30,101 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:26:30,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:26:30,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-18 09:26:30,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 09:26:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-18 09:26:30,109 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-18 09:26:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:30,109 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-18 09:26:30,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:26:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-18 09:26:30,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-18 09:26:30,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:30,110 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-18 09:26:30,110 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:30,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:30,110 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-18 09:26:30,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:30,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:30,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:30,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:30,378 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:30,563 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:26:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:31,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:31,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:31,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:31,319 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:31,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:31,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:31,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:31,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:31,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 8 treesize of output 7 [2019-02-18 09:26:31,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:31,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:31,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:31,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:31,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:32,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:32,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:32,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:33,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:33,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-18 09:26:33,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:33,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:26:33,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:26:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-18 09:26:33,147 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-18 09:26:33,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:33,970 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-18 09:26:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:26:33,971 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-18 09:26:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:33,972 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:26:33,972 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:26:33,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-18 09:26:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:26:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-18 09:26:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-18 09:26:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-18 09:26:33,979 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-18 09:26:33,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:33,979 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-18 09:26:33,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:26:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-18 09:26:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-18 09:26:33,980 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:33,980 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-18 09:26:33,981 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:33,981 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-18 09:26:33,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:33,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:33,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:34,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:34,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:34,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:34,731 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:34,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:34,732 INFO 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:34,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:34,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:34,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-18 09:26:34,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:34,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:34,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:34,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:34,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:34,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:35,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:35,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:35,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:35,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:35,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:36,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:36,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-18 09:26:36,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:36,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:26:36,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:26:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:36,984 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-18 09:26:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:37,833 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-18 09:26:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:26:37,833 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-18 09:26:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:37,834 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:26:37,834 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:26:37,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:26:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-18 09:26:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:26:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-18 09:26:37,840 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-18 09:26:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:37,841 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-18 09:26:37,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:26:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-18 09:26:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-18 09:26:37,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:37,842 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-18 09:26:37,842 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-18 09:26:37,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:38,013 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:38,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:38,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:38,650 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:38,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,650 INFO 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:38,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:38,659 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:38,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:38,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:38,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:38,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:38,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:38,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:38,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:39,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:39,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:39,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:39,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:39,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-18 09:26:41,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:41,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:26:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:26:41,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-18 09:26:41,140 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-18 09:26:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:42,180 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-18 09:26:42,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:26:42,181 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-18 09:26:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:42,182 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:26:42,182 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:26:42,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-18 09:26:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:26:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-18 09:26:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:26:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-18 09:26:42,187 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-18 09:26:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:42,188 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-18 09:26:42,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:26:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-18 09:26:42,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-18 09:26:42,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:42,189 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-18 09:26:42,189 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:42,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-18 09:26:42,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:42,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:42,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:42,387 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:26:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:43,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:43,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:43,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:43,144 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,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:43,144 INFO 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:43,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:43,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:43,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:43,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:43,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:43,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:43,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:44,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:44,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:44,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:44,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:44,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:45,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:45,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-18 09:26:45,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:45,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:26:45,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:26:45,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:45,652 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-18 09:26:46,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:46,745 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-18 09:26:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:26:46,745 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-18 09:26:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:46,746 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:26:46,746 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:26:46,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:26:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-18 09:26:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:26:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-18 09:26:46,753 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-18 09:26:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:46,753 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-18 09:26:46,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:26:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-18 09:26:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-18 09:26:46,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:46,754 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-18 09:26:46,754 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:46,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-18 09:26:46,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:46,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:46,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:47,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:47,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:47,637 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:47,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,637 INFO 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:47,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:47,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:47,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:26:47,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:47,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:47,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 8 treesize of output 7 [2019-02-18 09:26:47,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:47,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:47,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:48,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:48,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:48,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:48,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:48,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:50,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:50,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-18 09:26:50,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:50,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:26:50,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:26:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-18 09:26:50,368 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-18 09:26:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:51,741 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-18 09:26:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:26:51,742 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-18 09:26:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:51,743 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:26:51,743 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:26:51,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-18 09:26:51,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:26:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-18 09:26:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:26:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-18 09:26:51,749 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-18 09:26:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:51,749 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-18 09:26:51,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:26:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-18 09:26:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:26:51,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:51,750 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-18 09:26:51,750 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:51,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:51,751 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-18 09:26:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:51,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:51,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:52,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:52,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:52,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:52,677 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,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:52,677 INFO 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:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:52,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:52,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:52,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:52,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:52,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:52,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:52,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:52,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:26:53,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:26:53,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:53,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:53,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:26:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:53,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:55,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:55,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-18 09:26:55,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:55,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:26:55,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:26:55,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:55,650 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-18 09:26:56,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:56,803 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-18 09:26:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:26:56,803 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-18 09:26:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:56,804 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:26:56,804 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:26:56,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:56,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:26:56,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-18 09:26:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:26:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-18 09:26:56,810 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-18 09:26:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:56,810 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-18 09:26:56,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:26:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-18 09:26:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-18 09:26:56,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:56,811 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-18 09:26:56,811 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:56,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-18 09:26:56,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:56,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:56,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:56,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:57,070 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:57,310 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:26:57,586 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:57,867 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:58,164 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:26:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:26:59,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:59,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:59,009 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,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:59,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:59,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:59,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:59,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:26:59,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:26:59,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:26:59,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:00,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:00,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:00,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:00,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:00,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-18 09:27:02,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:02,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:27:02,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:27:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:27:02,987 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-18 09:27:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:04,209 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-18 09:27:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:27:04,210 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-18 09:27:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:04,211 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:27:04,211 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:27:04,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:27:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:27:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-18 09:27:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:27:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-18 09:27:04,215 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-18 09:27:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:04,216 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-18 09:27:04,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:27:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-18 09:27:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:27:04,219 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:04,219 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-18 09:27:04,219 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-18 09:27:04,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:04,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:04,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:04,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:05,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:05,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:05,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:05,279 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:05,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:05,279 INFO 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:27:05,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:05,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:05,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:27:05,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:05,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:05,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:05,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:05,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:05,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:06,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:06,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:06,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:06,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:06,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:08,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-18 09:27:08,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:08,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:27:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:27:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:27:08,569 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-18 09:27:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:10,322 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-18 09:27:10,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:27:10,323 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-18 09:27:10,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:10,323 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:27:10,324 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:27:10,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:27:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:27:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-18 09:27:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:27:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-18 09:27:10,328 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-18 09:27:10,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:10,329 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-18 09:27:10,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:27:10,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-18 09:27:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-18 09:27:10,329 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:10,329 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-18 09:27:10,329 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:10,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-18 09:27:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:10,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:10,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:10,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:11,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:11,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:11,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:11,551 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:11,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:11,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:11,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:11,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:11,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:11,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:11,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:11,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 8 treesize of output 7 [2019-02-18 09:27:11,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:11,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:11,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:12,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:12,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:12,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:12,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:12,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:14,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:14,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-18 09:27:14,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:14,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:27:14,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:27:14,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-18 09:27:14,909 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-18 09:27:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:16,426 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-18 09:27:16,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:27:16,426 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-18 09:27:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:16,427 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:27:16,427 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:27:16,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-18 09:27:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:27:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-18 09:27:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 09:27:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-18 09:27:16,431 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-18 09:27:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:16,431 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-18 09:27:16,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:27:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-18 09:27:16,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-18 09:27:16,432 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:16,432 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-18 09:27:16,432 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:16,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:16,433 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-18 09:27:16,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:16,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:16,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:16,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:16,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:16,680 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:16,852 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:27:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:17,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:17,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:17,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:17,802 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:17,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:17,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:17,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:17,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:17,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 8 treesize of output 7 [2019-02-18 09:27:17,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:17,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:17,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:19,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:19,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:19,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:19,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:19,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:21,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:21,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-18 09:27:21,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:21,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:27:21,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:27:21,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:21,559 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-18 09:27:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:22,978 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-18 09:27:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:27:22,979 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-18 09:27:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:22,979 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:27:22,980 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:27:22,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:27:22,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-18 09:27:22,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 09:27:22,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-18 09:27:22,984 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-18 09:27:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:22,985 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-18 09:27:22,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:27:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-18 09:27:22,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-18 09:27:22,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:22,986 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-18 09:27:22,986 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:22,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-18 09:27:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:22,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:22,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:23,156 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:24,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:24,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:24,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:24,131 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:24,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:24,131 INFO 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:27:24,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:24,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:24,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:27:24,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:24,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:24,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:24,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:24,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:24,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:25,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:25,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:25,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:25,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:25,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:28,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-18 09:27:28,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:27:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:27:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-18 09:27:28,196 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-18 09:27:30,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:30,030 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-18 09:27:30,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:27:30,031 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-18 09:27:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:30,032 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:27:30,032 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:27:30,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-18 09:27:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:27:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-18 09:27:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 09:27:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-18 09:27:30,038 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-18 09:27:30,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:30,038 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-18 09:27:30,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:27:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-18 09:27:30,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-18 09:27:30,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:30,039 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-18 09:27:30,039 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-18 09:27:30,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:30,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:30,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:30,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:30,218 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:27:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:31,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:31,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:31,474 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:31,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,474 INFO 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:27:31,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:31,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:31,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:31,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:31,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:31,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:31,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:31,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:31,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:32,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:32,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:32,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:32,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:32,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:35,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:35,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-18 09:27:35,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:35,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:27:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:27:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:35,468 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-18 09:27:37,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:37,219 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-18 09:27:37,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:27:37,220 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-18 09:27:37,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:37,221 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:27:37,221 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:27:37,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:27:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-18 09:27:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:27:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-18 09:27:37,226 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-18 09:27:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:37,227 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-18 09:27:37,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:27:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-18 09:27:37,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:27:37,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:37,227 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-18 09:27:37,228 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:37,228 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-18 09:27:37,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:37,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:37,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:37,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:37,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:37,457 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:38,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:38,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:38,557 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:38,557 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:38,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:38,557 INFO 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:38,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:38,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:38,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:38,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:38,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:38,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:38,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:40,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:40,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:40,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:40,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:40,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:42,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:42,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-18 09:27:42,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:42,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:27:42,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:27:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-18 09:27:42,977 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-18 09:27:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:44,869 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-18 09:27:44,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:27:44,869 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-18 09:27:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:44,870 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:27:44,870 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:27:44,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-18 09:27:44,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:27:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-18 09:27:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 09:27:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-18 09:27:44,875 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-18 09:27:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:44,876 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-18 09:27:44,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:27:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-18 09:27:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-18 09:27:44,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:44,876 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-18 09:27:44,877 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:44,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:44,877 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-18 09:27:44,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:44,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:44,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:44,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:44,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:45,112 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:45,363 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:27:45,534 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:46,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:46,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:46,827 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,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:46,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:46,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:46,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-18 09:27:46,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:46,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:46,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:46,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:46,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:46,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:48,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:48,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:48,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:48,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:48,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:51,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:51,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-18 09:27:51,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:51,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:27:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:27:51,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:51,357 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-18 09:27:54,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:54,116 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-18 09:27:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:27:54,117 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-18 09:27:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:54,117 INFO L225 Difference]: With dead ends: 72 [2019-02-18 09:27:54,118 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:27:54,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:54,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:27:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-18 09:27:54,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:27:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-18 09:27:54,122 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-18 09:27:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:54,123 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-18 09:27:54,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:27:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-18 09:27:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:27:54,123 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:54,123 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-18 09:27:54,124 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:54,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:54,124 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-18 09:27:54,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:54,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:54,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:54,367 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:27:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:55,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:55,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:55,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:55,666 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:55,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:55,666 INFO 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:55,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:55,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:55,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:55,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:55,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:55,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:27:55,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:55,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:55,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:27:57,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:27:57,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:27:57,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:27:57,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:27:57,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:27:57,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:00,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:00,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-18 09:28:00,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:00,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:28:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:28:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-18 09:28:00,613 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-18 09:28:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:02,920 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-18 09:28:02,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:28:02,921 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-18 09:28:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:02,922 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:28:02,922 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:28:02,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-18 09:28:02,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:28:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-18 09:28:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 09:28:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-18 09:28:02,927 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-18 09:28:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:02,927 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-18 09:28:02,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:28:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-18 09:28:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-18 09:28:02,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:02,928 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-18 09:28:02,928 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:02,928 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-18 09:28:02,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:02,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:02,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:04,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:04,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:04,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:28:04,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,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 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:28:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:04,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:04,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:04,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:04,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:04,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:04,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:06,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:06,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:06,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:06,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:06,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:09,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:09,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-18 09:28:09,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:09,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:28:09,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:28:09,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:28:09,407 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-18 09:28:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:11,747 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-18 09:28:11,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:28:11,754 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-18 09:28:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:11,755 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:28:11,755 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:28:11,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:28:11,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:28:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-18 09:28:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:28:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-18 09:28:11,759 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-18 09:28:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:11,759 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-18 09:28:11,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:28:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-18 09:28:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-18 09:28:11,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:11,760 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-18 09:28:11,760 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:11,761 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-18 09:28:11,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:11,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:11,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:11,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:11,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:12,027 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:28:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:13,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:13,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:13,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:13,363 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:13,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:13,363 INFO 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:28:13,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:13,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:13,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:28:13,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:13,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:13,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:13,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:13,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:13,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:15,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:15,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:15,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:15,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:15,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:19,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-18 09:28:19,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:19,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:28:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:28:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:28:19,080 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-18 09:28:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:21,997 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-18 09:28:21,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:28:21,997 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-18 09:28:21,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:21,998 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:28:21,998 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:28:21,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:28:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:28:22,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-18 09:28:22,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:28:22,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-18 09:28:22,004 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-18 09:28:22,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:22,004 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-18 09:28:22,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:28:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-18 09:28:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-18 09:28:22,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:22,005 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-18 09:28:22,005 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-18 09:28:22,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:22,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:22,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:22,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:22,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:22,245 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:28:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:23,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:23,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:23,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:23,826 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:23,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:23,826 INFO 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:28:23,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:23,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:23,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:23,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:23,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:23,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:23,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:23,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:23,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:25,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:25,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:25,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:25,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:25,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:29,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:29,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:29,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-18 09:28:29,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:29,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:28:29,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:28:29,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:28:29,646 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-18 09:28:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:32,482 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-18 09:28:32,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:28:32,482 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-18 09:28:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:32,483 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:28:32,483 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:28:32,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:28:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:28:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-18 09:28:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:28:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-18 09:28:32,488 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-18 09:28:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:32,489 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-18 09:28:32,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:28:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-18 09:28:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-18 09:28:32,490 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:32,490 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-18 09:28:32,490 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:32,490 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-18 09:28:32,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:32,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:32,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:32,704 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:28:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:34,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:34,200 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,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,201 INFO 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:28:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:34,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:34,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:34,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:34,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:34,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:36,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:36,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:36,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:36,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:36,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:40,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:40,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-18 09:28:40,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:40,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:28:40,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:28:40,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-18 09:28:40,242 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-18 09:28:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:42,988 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-18 09:28:42,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:28:42,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-18 09:28:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:42,989 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:28:42,989 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:28:42,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-18 09:28:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:28:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-18 09:28:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:28:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-18 09:28:42,993 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-18 09:28:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:42,994 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-18 09:28:42,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:28:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-18 09:28:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:28:42,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:42,994 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-18 09:28:42,994 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-18 09:28:42,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:42,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:42,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:42,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:44,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:44,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:44,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:44,621 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:44,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:44,621 INFO 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:28:44,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:44,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:44,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-18 09:28:44,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:44,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:44,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:44,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:44,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:46,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:46,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:46,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:46,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:46,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:51,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:51,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-18 09:28:51,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:51,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:28:51,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:28:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:51,018 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-18 09:28:54,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:54,552 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-18 09:28:54,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:28:54,553 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-18 09:28:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:54,554 INFO L225 Difference]: With dead ends: 84 [2019-02-18 09:28:54,554 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:28:54,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:54,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:28:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-18 09:28:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-18 09:28:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-18 09:28:54,558 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-18 09:28:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:54,559 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-18 09:28:54,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:28:54,559 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-18 09:28:54,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-18 09:28:54,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:54,559 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-18 09:28:54,559 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:54,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-18 09:28:54,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:54,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:54,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:54,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:54,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:54,853 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:28:55,040 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:28:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:56,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:56,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:56,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:56,611 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:56,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:56,611 INFO 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:28:56,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:56,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:56,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:56,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:56,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:56,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:28:56,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:56,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:56,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:28:59,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:28:59,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:28:59,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:28:59,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:28:59,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:28:59,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:03,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:03,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-18 09:29:03,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:03,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:29:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:29:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-18 09:29:03,174 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-18 09:29:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:06,111 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-18 09:29:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:29:06,112 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-18 09:29:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:06,113 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:29:06,113 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:29:06,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-18 09:29:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:29:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-18 09:29:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:29:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-18 09:29:06,118 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-18 09:29:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:06,118 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-18 09:29:06,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:29:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-18 09:29:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:29:06,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:06,119 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-18 09:29:06,119 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:06,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-18 09:29:06,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:06,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:06,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:06,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:06,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:07,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:07,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:07,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:07,891 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:07,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:07,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:29:07,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:07,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:07,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:07,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:29:07,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:07,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:07,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:29:10,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:29:10,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:10,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:10,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:29:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:10,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:14,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:14,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-18 09:29:14,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:14,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:29:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:29:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:29:14,853 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-18 09:29:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:18,697 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-18 09:29:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:29:18,697 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-18 09:29:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:18,698 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:29:18,698 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:29:18,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:29:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:29:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-18 09:29:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-18 09:29:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-18 09:29:18,703 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-18 09:29:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:18,704 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-18 09:29:18,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:29:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-18 09:29:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-18 09:29:18,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:18,705 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-18 09:29:18,705 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:18,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:18,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-18 09:29:18,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:18,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:20,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:20,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:20,536 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:20,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,536 INFO 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:29:20,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:20,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:20,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-18 09:29:20,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:20,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:20,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:29:20,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:20,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:20,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:29:23,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:29:23,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:23,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:23,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:29:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:23,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:27,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:27,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-18 09:29:27,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:27,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:29:27,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:29:27,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-18 09:29:27,811 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-18 09:29:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:32,360 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-18 09:29:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:29:32,360 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-18 09:29:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:32,361 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:29:32,361 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:29:32,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-18 09:29:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:29:32,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-18 09:29:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-18 09:29:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-18 09:29:32,366 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-18 09:29:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:32,366 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-18 09:29:32,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:29:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-18 09:29:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-18 09:29:32,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:32,367 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-18 09:29:32,367 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:32,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:32,367 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-18 09:29:32,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:32,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:32,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:32,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:32,580 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:29:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:34,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:34,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:34,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:34,533 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:34,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:34,533 INFO 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:29:34,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:34,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:34,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:34,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:34,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:34,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:29:34,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:34,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:34,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:29:37,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:29:37,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:37,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:37,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:29:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:37,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:42,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:42,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-18 09:29:42,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:42,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:29:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:29:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:29:42,142 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-18 09:29:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:46,745 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-18 09:29:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:29:46,746 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-18 09:29:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:46,746 INFO L225 Difference]: With dead ends: 92 [2019-02-18 09:29:46,747 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:29:46,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:29:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:29:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-18 09:29:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 09:29:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-18 09:29:46,752 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-18 09:29:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:46,752 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-18 09:29:46,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:29:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-18 09:29:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-18 09:29:46,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:46,753 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-18 09:29:46,753 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-18 09:29:46,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:46,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:46,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:47,010 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:29:47,265 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:29:47,562 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:29:47,862 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:29:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:49,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:49,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:49,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:49,753 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:49,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:49,753 INFO 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:29:49,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:49,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:49,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:49,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:29:49,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:49,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:49,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:29:52,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:29:52,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:29:52,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:29:52,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:29:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:52,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:29:57,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:57,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-18 09:29:57,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:57,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 09:29:57,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 09:29:57,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:29:57,627 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-18 09:30:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:01,391 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-18 09:30:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:30:01,391 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-18 09:30:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:01,392 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:30:01,392 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:30:01,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:30:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:30:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-18 09:30:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-18 09:30:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-18 09:30:01,397 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-18 09:30:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:01,398 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-18 09:30:01,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 09:30:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-18 09:30:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-18 09:30:01,398 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:01,398 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-18 09:30:01,398 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:01,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-18 09:30:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:01,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:01,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:01,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:01,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:01,651 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:30:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:03,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:03,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:03,572 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:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:03,572 INFO 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:30:03,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:03,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:03,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-18 09:30:03,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:03,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:03,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:30:03,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:03,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:03,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:30:07,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:30:07,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:07,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:07,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:30:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:07,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:12,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:12,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-18 09:30:12,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:12,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:30:12,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:30:12,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:30:12,283 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-18 09:30:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:16,408 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-18 09:30:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:30:16,408 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-18 09:30:16,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:16,409 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:30:16,409 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:30:16,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:30:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:30:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-18 09:30:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:30:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-18 09:30:16,415 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-18 09:30:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:16,415 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-18 09:30:16,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:30:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-18 09:30:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:30:16,416 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:16,416 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-18 09:30:16,416 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:16,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:16,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-18 09:30:16,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:16,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:16,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:16,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:16,674 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:30:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:18,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:18,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:18,734 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:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:18,734 INFO 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:30:18,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:18,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:18,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:18,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:18,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:18,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:30:18,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:18,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:18,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:30:21,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:30:21,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:21,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:21,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:30:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:21,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:27,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-18 09:30:27,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:27,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 09:30:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 09:30:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:30:27,426 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-18 09:30:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:31,871 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-18 09:30:31,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:30:31,872 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-18 09:30:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:31,873 INFO L225 Difference]: With dead ends: 98 [2019-02-18 09:30:31,873 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:30:31,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:30:31,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:30:31,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-18 09:30:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:30:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-18 09:30:31,878 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-18 09:30:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:31,879 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-18 09:30:31,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 09:30:31,879 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-18 09:30:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-18 09:30:31,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:31,879 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-18 09:30:31,879 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-18 09:30:31,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:31,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:31,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:32,117 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:30:32,355 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:30:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:34,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:34,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:34,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:34,378 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:34,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:34,378 INFO 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:30:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:34,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:34,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:34,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:30:34,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:34,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:34,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:30:37,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:30:37,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:37,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:37,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:30:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:37,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:43,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:43,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:43,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-18 09:30:43,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:43,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 09:30:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 09:30:43,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:30:43,214 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-18 09:30:47,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:47,366 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-18 09:30:47,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:30:47,367 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-18 09:30:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:47,368 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:30:47,368 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:30:47,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:30:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:30:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-18 09:30:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:30:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-18 09:30:47,373 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-18 09:30:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:47,374 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-18 09:30:47,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 09:30:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-18 09:30:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 09:30:47,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:47,374 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-18 09:30:47,375 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:47,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-18 09:30:47,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:47,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:47,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:47,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:47,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:47,567 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:30:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:49,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:49,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:49,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:49,566 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,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:49,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:30:49,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:49,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:49,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-18 09:30:49,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:49,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:49,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:30:49,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:49,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:49,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:30:53,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:30:53,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:30:53,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:30:53,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:30:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:53,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:30:59,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:59,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-18 09:30:59,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:59,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:30:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:30:59,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-18 09:30:59,557 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-18 09:31:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:03,730 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-18 09:31:03,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:31:03,730 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-18 09:31:03,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:03,731 INFO L225 Difference]: With dead ends: 102 [2019-02-18 09:31:03,731 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:31:03,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-18 09:31:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:31:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-18 09:31:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 09:31:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-18 09:31:03,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-18 09:31:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:03,736 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-18 09:31:03,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:31:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-18 09:31:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-18 09:31:03,737 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:03,737 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-18 09:31:03,738 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-18 09:31:03,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:03,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:03,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:03,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:06,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:06,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:06,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:06,023 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:06,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:06,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 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:31:06,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:06,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:06,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:06,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:06,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:06,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 8 treesize of output 7 [2019-02-18 09:31:06,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:06,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:06,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:31:09,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:31:09,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:09,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:09,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:31:09,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:09,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:15,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:15,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-18 09:31:15,616 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:15,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 09:31:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 09:31:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:31:15,618 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-18 09:31:20,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:20,003 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-18 09:31:20,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:31:20,003 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-18 09:31:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:20,004 INFO L225 Difference]: With dead ends: 104 [2019-02-18 09:31:20,004 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:31:20,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:31:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:31:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-18 09:31:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-18 09:31:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-18 09:31:20,011 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-18 09:31:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:20,012 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-18 09:31:20,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 09:31:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-18 09:31:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-18 09:31:20,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:20,012 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-18 09:31:20,013 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-18 09:31:20,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:20,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:20,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:22,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:22,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:22,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:22,534 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,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:22,534 INFO 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:31:22,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:22,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:22,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:22,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:31:22,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:22,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:22,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:31:26,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:31:26,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:26,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:26,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:31:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:26,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:32,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:32,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-18 09:31:32,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:32,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 09:31:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 09:31:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:31:32,813 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-18 09:31:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:37,512 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-18 09:31:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:31:37,512 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-18 09:31:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:37,514 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:31:37,514 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:31:37,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:31:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:31:37,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-18 09:31:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-18 09:31:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-18 09:31:37,521 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-18 09:31:37,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:37,521 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-18 09:31:37,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 09:31:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-18 09:31:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-18 09:31:37,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:37,522 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-18 09:31:37,522 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:37,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:37,523 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-18 09:31:37,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:37,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:37,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:37,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:37,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:37,808 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:31:38,063 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:31:38,349 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:31:38,650 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:31:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:41,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:41,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:41,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:41,036 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:41,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:41,036 INFO 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:31:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:41,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:41,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-18 09:31:41,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:41,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:41,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:31:41,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:41,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:41,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:31:44,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:31:44,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:44,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:44,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:31:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:45,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:51,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:51,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-18 09:31:51,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:51,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:31:51,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:31:51,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:31:51,797 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-18 09:31:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:57,366 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-18 09:31:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:31:57,367 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-18 09:31:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:57,367 INFO L225 Difference]: With dead ends: 108 [2019-02-18 09:31:57,368 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:31:57,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:31:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:31:57,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-18 09:31:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-18 09:31:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-18 09:31:57,374 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-18 09:31:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:57,374 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-18 09:31:57,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:31:57,374 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-18 09:31:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-18 09:31:57,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:57,375 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-18 09:31:57,375 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-18 09:31:57,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:57,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:57,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:57,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:31:59,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:59,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:59,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:59,903 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:59,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:59,903 INFO 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:31:59,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:59,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:59,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:59,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:59,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:59,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:31:59,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:31:59,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:31:59,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:32:04,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:32:04,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:04,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:04,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:32:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:04,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:10,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:10,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-18 09:32:10,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:11,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-18 09:32:11,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-18 09:32:11,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:32:11,001 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-18 09:32:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:17,928 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-18 09:32:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:32:17,929 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-18 09:32:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:17,930 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:32:17,930 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:32:17,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:32:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:32:17,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-18 09:32:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:32:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-18 09:32:17,937 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-18 09:32:17,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:17,937 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-18 09:32:17,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-18 09:32:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-18 09:32:17,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 09:32:17,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:17,938 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-18 09:32:17,939 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:17,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:17,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-18 09:32:17,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:17,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:17,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:17,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:17,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:18,257 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:32:18,493 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:32:18,755 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:32:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:21,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:21,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:21,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:21,405 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,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:21,405 INFO 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:32:21,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:21,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:21,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:21,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:32:21,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:21,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:21,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:32:25,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:32:25,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:25,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:25,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:32:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:25,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:32,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:32,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-18 09:32:32,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:32,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 09:32:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 09:32:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:32:32,782 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-18 09:32:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:37,512 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-18 09:32:37,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:32:37,513 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-18 09:32:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:37,514 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:32:37,514 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:32:37,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:32:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:32:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-18 09:32:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-18 09:32:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-18 09:32:37,520 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-18 09:32:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:37,520 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-18 09:32:37,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 09:32:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-18 09:32:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-18 09:32:37,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:37,521 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-18 09:32:37,521 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:37,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-18 09:32:37,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:37,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:37,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:37,797 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:32:38,065 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:32:38,329 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:32:38,639 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:32:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:41,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:41,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:41,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:41,216 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:41,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:41,216 INFO 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:32:41,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:41,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:41,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-18 09:32:41,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:41,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:41,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:32:41,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:41,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:41,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:32:45,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:32:45,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:32:45,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:32:45,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:32:45,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:45,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:32:52,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:52,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-18 09:32:52,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:52,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 09:32:52,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 09:32:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:32:52,931 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-18 09:32:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:59,497 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-18 09:32:59,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:32:59,498 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-18 09:32:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:59,499 INFO L225 Difference]: With dead ends: 114 [2019-02-18 09:32:59,499 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:32:59,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:32:59,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:32:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-18 09:32:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 09:32:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-18 09:32:59,506 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-18 09:32:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:59,506 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-18 09:32:59,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 09:32:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-18 09:32:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 09:32:59,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:59,507 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-18 09:32:59,507 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-18 09:32:59,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:59,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:59,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:59,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:02,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:02,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:02,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:02,253 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:02,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:02,253 INFO 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:33:02,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:02,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:02,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:02,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:02,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:02,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:33:02,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:02,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:02,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:33:06,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:33:06,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:06,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:06,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:33:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:06,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:14,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:14,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-18 09:33:14,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:14,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-18 09:33:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-18 09:33:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:33:14,582 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-18 09:33:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:19,802 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-18 09:33:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:33:19,803 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-18 09:33:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:19,804 INFO L225 Difference]: With dead ends: 116 [2019-02-18 09:33:19,804 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:33:19,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:33:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:33:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-18 09:33:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-18 09:33:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-18 09:33:19,811 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-18 09:33:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:19,811 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-18 09:33:19,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-18 09:33:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-18 09:33:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-18 09:33:19,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:19,812 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-18 09:33:19,813 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-18 09:33:19,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:19,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:19,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:19,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:19,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:22,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:22,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:22,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:22,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:33:22,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:22,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 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:33:22,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:22,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:33:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:22,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:22,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:33:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:22,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:22,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:33:27,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:33:27,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:27,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:27,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:33:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:27,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:35,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:35,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-18 09:33:35,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:35,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-18 09:33:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-18 09:33:35,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 09:33:35,124 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-18 09:33:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:42,371 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-18 09:33:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:33:42,372 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-18 09:33:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:42,373 INFO L225 Difference]: With dead ends: 118 [2019-02-18 09:33:42,373 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:33:42,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 09:33:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:33:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-18 09:33:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-18 09:33:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-18 09:33:42,378 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-18 09:33:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:42,378 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-18 09:33:42,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-18 09:33:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-18 09:33:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-18 09:33:42,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:42,379 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-18 09:33:42,379 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-18 09:33:42,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:42,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:42,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:42,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:45,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:45,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:45,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:45,563 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:45,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:45,563 INFO 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:33:45,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:45,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:45,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-18 09:33:45,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:45,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:45,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:33:45,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:45,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:33:50,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:33:50,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:33:50,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:33:50,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:33:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:50,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:33:58,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:58,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-18 09:33:58,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:58,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 09:33:58,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 09:33:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:33:58,484 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-18 09:34:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:04,489 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-18 09:34:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:34:04,489 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-18 09:34:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:04,491 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:34:04,491 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:34:04,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:34:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:34:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-18 09:34:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-18 09:34:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-18 09:34:04,497 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-18 09:34:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:04,497 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-18 09:34:04,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 09:34:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-18 09:34:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-18 09:34:04,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:04,497 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-18 09:34:04,498 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-18 09:34:04,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:04,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:04,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:07,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:07,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:07,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:07,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:34:07,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:07,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 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:34:07,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:07,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:07,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:07,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:07,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:07,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:34:07,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:07,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:07,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:34:12,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:34:12,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:12,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:12,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:34:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:12,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:21,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-18 09:34:21,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:21,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-18 09:34:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-18 09:34:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 09:34:21,266 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-18 09:34:26,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:26,627 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-18 09:34:26,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:34:26,628 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-18 09:34:26,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:26,629 INFO L225 Difference]: With dead ends: 122 [2019-02-18 09:34:26,629 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 09:34:26,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 09:34:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 09:34:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-18 09:34:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-18 09:34:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-18 09:34:26,633 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-18 09:34:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:26,634 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-18 09:34:26,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-18 09:34:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-18 09:34:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-18 09:34:26,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:26,634 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-18 09:34:26,634 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:26,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:26,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-18 09:34:26,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:26,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:26,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:26,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:26,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:29,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:29,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:29,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:29,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:34:29,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:29,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 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:34:29,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:29,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:29,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:29,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:34:29,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:29,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:29,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:34:34,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:34:34,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:34,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:34,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:34:34,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:34,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-18 09:34:43,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-18 09:34:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-18 09:34:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:34:43,456 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-18 09:34:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:50,645 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-18 09:34:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:34:50,651 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-18 09:34:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:50,652 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:34:50,652 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 09:34:50,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:34:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 09:34:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-18 09:34:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-18 09:34:50,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-18 09:34:50,658 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-18 09:34:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:50,658 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-18 09:34:50,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-18 09:34:50,658 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-18 09:34:50,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-18 09:34:50,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:50,659 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-18 09:34:50,659 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-18 09:34:50,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:50,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:50,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:50,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:53,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:53,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:53,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:53,990 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:53,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:53,990 INFO 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:34:53,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:34:53,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:34:54,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-18 09:34:54,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:54,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:54,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 8 treesize of output 7 [2019-02-18 09:34:54,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:54,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:54,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:34:59,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:34:59,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:34:59,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:34:59,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:34:59,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:34:59,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:08,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:08,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-18 09:35:08,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:08,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-18 09:35:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-18 09:35:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 09:35:08,422 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-18 09:35:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:17,352 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-18 09:35:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:35:17,352 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-18 09:35:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:17,353 INFO L225 Difference]: With dead ends: 126 [2019-02-18 09:35:17,353 INFO L226 Difference]: Without dead ends: 125 [2019-02-18 09:35:17,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 09:35:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-18 09:35:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-18 09:35:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-18 09:35:17,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-18 09:35:17,359 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-18 09:35:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:17,360 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-18 09:35:17,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-18 09:35:17,360 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-18 09:35:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-18 09:35:17,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:17,360 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-18 09:35:17,361 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-18 09:35:17,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:17,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:17,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:17,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:17,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:17,606 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:35:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:20,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:20,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:20,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:20,729 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:20,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:20,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:35:20,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:35:20,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:35:20,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:35:20,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:20,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:20,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:35:20,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:20,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:20,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:35:26,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:35:26,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:26,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:26,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:35:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:26,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:35,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:35,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-18 09:35:35,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:35,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-18 09:35:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-18 09:35:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:35:35,459 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-18 09:35:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:44,523 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-18 09:35:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:35:44,523 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-18 09:35:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:44,524 INFO L225 Difference]: With dead ends: 128 [2019-02-18 09:35:44,524 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 09:35:44,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:35:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 09:35:44,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-18 09:35:44,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-18 09:35:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-18 09:35:44,530 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-18 09:35:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:44,531 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-18 09:35:44,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-18 09:35:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-18 09:35:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-18 09:35:44,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:44,532 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-18 09:35:44,532 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-18 09:35:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:44,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:44,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:44,832 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:35:45,092 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:35:45,361 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:35:45,640 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:35:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:48,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:48,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:48,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:48,964 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:48,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:48,964 INFO 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:35:48,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:48,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:49,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:49,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:35:49,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:49,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:49,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:35:54,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:35:54,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:35:54,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:35:54,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:35:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:35:54,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:04,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:04,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-18 09:36:04,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:04,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-18 09:36:04,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-18 09:36:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 09:36:04,136 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-18 09:36:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:11,905 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-18 09:36:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:36:11,905 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-18 09:36:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:11,906 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:36:11,906 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 09:36:11,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 09:36:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 09:36:11,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-18 09:36:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-18 09:36:11,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-18 09:36:11,911 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-18 09:36:11,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:11,912 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-18 09:36:11,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-18 09:36:11,912 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-18 09:36:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-18 09:36:11,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:11,912 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-18 09:36:11,913 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:11,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:11,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-18 09:36:11,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:11,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:11,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:11,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:11,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:12,166 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:36:12,385 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:36:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:15,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:15,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:15,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:15,900 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:15,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:15,900 INFO 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:36:15,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:36:15,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:36:16,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-18 09:36:16,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:16,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:16,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 8 treesize of output 7 [2019-02-18 09:36:16,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:16,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:16,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:36:21,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:36:21,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:21,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:21,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:36:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:21,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:31,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:31,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-18 09:36:31,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:31,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-18 09:36:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-18 09:36:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:36:31,439 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-18 09:36:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:37,810 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-18 09:36:37,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:36:37,810 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-18 09:36:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:37,811 INFO L225 Difference]: With dead ends: 132 [2019-02-18 09:36:37,812 INFO L226 Difference]: Without dead ends: 131 [2019-02-18 09:36:37,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:36:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-18 09:36:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-18 09:36:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-18 09:36:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-18 09:36:37,817 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-18 09:36:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:37,817 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-18 09:36:37,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-18 09:36:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-18 09:36:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-18 09:36:37,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:37,818 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-18 09:36:37,818 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:37,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-18 09:36:37,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:37,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:37,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:37,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:41,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:41,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:41,518 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,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:41,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:36:41,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:41,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:41,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:41,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:41,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:41,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:36:41,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:41,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:41,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:36:47,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:36:47,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:36:47,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:36:47,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:36:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:47,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:36:57,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:57,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-18 09:36:57,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:57,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-18 09:36:57,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-18 09:36:57,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 09:36:57,802 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-18 09:37:05,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:05,637 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-18 09:37:05,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:37:05,637 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-18 09:37:05,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:05,638 INFO L225 Difference]: With dead ends: 134 [2019-02-18 09:37:05,639 INFO L226 Difference]: Without dead ends: 133 [2019-02-18 09:37:05,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 09:37:05,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-18 09:37:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-18 09:37:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 09:37:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-18 09:37:05,645 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-18 09:37:05,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:05,645 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-18 09:37:05,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-18 09:37:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-18 09:37:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-18 09:37:05,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:05,646 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-18 09:37:05,646 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:05,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-18 09:37:05,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:05,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:05,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:05,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:05,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:05,850 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:37:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:09,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:09,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:09,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:09,218 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:09,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:09,219 INFO 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:37:09,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:09,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:09,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:09,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:37:09,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:09,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:09,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:37:15,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:37:15,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:15,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:15,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:37:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:15,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-18 09:37:26,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:26,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-18 09:37:26,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-18 09:37:26,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:37:26,179 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-18 09:37:36,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:36,376 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-18 09:37:36,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:37:36,377 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-18 09:37:36,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:36,378 INFO L225 Difference]: With dead ends: 136 [2019-02-18 09:37:36,378 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:37:36,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:37:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:37:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-18 09:37:36,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 09:37:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-18 09:37:36,386 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-18 09:37:36,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:36,386 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-18 09:37:36,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-18 09:37:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-18 09:37:36,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-18 09:37:36,387 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:36,387 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-18 09:37:36,387 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:36,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:36,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-18 09:37:36,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:36,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:36,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:39,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:39,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:39,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:39,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:39,953 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:39,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:39,953 INFO 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:37:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:37:39,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:37:40,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-18 09:37:40,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:40,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:40,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 8 treesize of output 7 [2019-02-18 09:37:40,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:40,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:37:46,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:37:46,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:37:46,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:37:46,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:37:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:47,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:37:58,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:58,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-18 09:37:58,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:58,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-18 09:37:58,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-18 09:37:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-18 09:37:58,028 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-18 09:38:05,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:05,112 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-18 09:38:05,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:38:05,113 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-18 09:38:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:05,114 INFO L225 Difference]: With dead ends: 138 [2019-02-18 09:38:05,114 INFO L226 Difference]: Without dead ends: 137 [2019-02-18 09:38:05,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-18 09:38:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-18 09:38:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-18 09:38:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 09:38:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-18 09:38:05,120 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-18 09:38:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:05,120 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-18 09:38:05,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-18 09:38:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-18 09:38:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-18 09:38:05,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:05,121 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-18 09:38:05,121 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-18 09:38:05,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:05,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:05,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:08,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:08,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:08,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:08,986 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:08,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:08,986 INFO 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:38:09,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:09,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:09,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:09,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:09,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:09,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:38:09,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:09,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:38:15,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:38:15,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:15,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:38:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:15,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:26,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-02-18 09:38:26,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:26,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-18 09:38:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-18 09:38:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:38:26,765 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-02-18 09:38:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:37,086 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-18 09:38:37,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:38:37,086 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-02-18 09:38:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:37,087 INFO L225 Difference]: With dead ends: 140 [2019-02-18 09:38:37,087 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 09:38:37,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:38:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 09:38:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-02-18 09:38:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-02-18 09:38:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-02-18 09:38:37,093 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-02-18 09:38:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:37,094 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-02-18 09:38:37,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-18 09:38:37,094 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-02-18 09:38:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-02-18 09:38:37,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:37,095 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-02-18 09:38:37,095 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:37,095 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-02-18 09:38:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:37,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:37,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:40,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:40,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:40,807 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:40,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:40,807 INFO 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:38:40,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:40,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:40,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:40,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 8 treesize of output 7 [2019-02-18 09:38:40,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:40,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:38:47,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:38:47,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:47,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:38:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:47,461 INFO L316 TraceCheckSpWp]: Computing backward predicates...